Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Compatible Triangulations of Spatial Decompositions
VIS '04 Proceedings of the conference on Visualization '04
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Optimal MST maintenance for transient deletion of every node in planar graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper, we present an $\Theta (n)$ time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane. Up to now, only an O(n log n) worst-case deterministic and an O(n) expected time bound have been shown, leaving an O(n) deterministic solution open to conjecture.