On-line construction of the convex hull of a simple polyline
Information Processing Letters
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Computational Geometry: Theory and Applications
Largest and smallest tours and convex hulls for imprecise points
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference 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
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Self-improving algorithms for convex hulls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
An application of a self-organizing model to the design of urban transport networks
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Geometric computations on indecisive points
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
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
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
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.89 |
We present a linear-time algorithm for computing a triangulation of n points in 2D whose positions are constrained to n disjoint disks of uniform size, after O(nlogn) preprocessing applied to these disks. Our algorithm can be extended to any collection of convex sets of bounded areas and aspect ratios, assuming no point lies in more than some constant number of sets (bounded depth of overlap), and each set contains only a constant number of query points.