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
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Structural tolerance and delauny triangulation
Information Processing Letters
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives
SIGAL '90 Proceedings of the International Symposium on Algorithms
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
Triangulating input-constrained planar point sets
Information Processing Letters
Preprocessing Imprecise Points and Splitting Triangulations
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The maximal distance between imprecise point objects
Fuzzy Sets and Systems
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
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(nlogn) 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.