A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Dense packings of congruent circles in a circle
Discrete Mathematics
Handbook of discrete and computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Structural tolerance and delauny triangulation
Information Processing Letters
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Computational Geometry: Theory and Applications
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Self-improving algorithms for convex hulls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
(Approximate) uncertain skylines
Proceedings of the 14th International Conference on Database Theory
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
An assumption of nearly all algorithms in computational geometry is that the input points are given precisely, so it is interesting to ask what is the value of imprecise information about points. We show how to preprocess a set of n disjoint unit disks in the plane in O(n log n) time so that if one point per disk is specified with precise coordinates, the Delaunay triangulation can be computed in linear time. From the Delaunay, one can obtain the Gabriel graph and a Euclidean minimum spanning tree; it is interesting to note the roles that these two structures play in our algorithm to quickly compute the Delaunay.