On the Topology of the Restricted Delaunay Triangulation and Witness Complex in Higher Dimensions
On Unit Distances in a Convex Polygon
Opaque sets
Open Problems from CCCG 2002
Operations on polytopes: application to tolerance analysis
Optimal 3D Angular Resolution for Low-Degree Graphs
Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve
Optimal competitive online ray search with an error-prone robot
Optimal Moebius Transformations for Information Visualization and Meshing
Optimal Point Movement for Covering Circular Regions
Optimal Point Placement for Mesh Smoothing
Optimal Polygonal Representation of Planar Graphs
Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension
Optimal stochastic planarization
Optimal topological simplification of discrete functions on surfaces
Optimally cutting a surface into a disk
Optimally fast incremental Manhattan plane embedding and planar tight span construction
Optimization Over Zonotopes and Training Support Vector Machines
Optimized Color Gamuts for Tiled Displays
Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem