Kenneth L. Clarkson
ABSTRACT
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, unknown, and arbitrary distribution. The first phase of our algorithm builds data structures that store relevant information about the input distribution. The second phase uses these data structures to efficiently compute the Delaunay triangulation of the input. The running time of our algorithm matches the information-theoretic lower bound for the given input distribution, implying that if the input distribution has low entropy, then our algorithm beats the standard Ω(n log n) bound for computing Delaunay triangulations.
Our algorithm and analysis use a variety of techniques: ε-nets for disks, entropy-optimal point-location data structures, linear-time splitting of Delaunay triangulations, and information-theoretic arguments.
- Ailon, N., Chazelle, B., Comandur, S., Liu, D., Self-Improving Algorithms, Proc. 17th SODA (2006), 261--270. Google Scholar
Digital Library
- Aggarwal, A., Guibas, L., Saxe, J., Shor, P., A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon, Discrete and Computational Geometry 4, 1989, 591--604.Google ScholarDigital Library
- Arya, S., Malamatos, T., Mount, D. M., Wong, K.-C. Optimal Expected-Case Planar Point Location, SIAM J. Comput. 37, 2007, 584--610 Google ScholarDigital Library
- Chazelle, B., An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra, SIAM J. Computing 21, 1992, 671--696. Google ScholarDigital Library
- Chazelle, B., Devillers, O.,Hurtado, F., Mora, M., Sacristan, V., Teillaud, M. Splitting a Delaunay Triangulation in Linear Time, Algorithmica 34, 2002, 39--46.Google ScholarDigital Library
- Clarkson, K., Varadarajan, K. Improved Approximation Algorithms for Geometric Set Cover Discrete and Computation Geometry 37, 2007, 43--58. Google ScholarDigital Library
- Matousek, J., Seidel, R., Welzl, E. How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces, Proc. 6th SOCG (1990), 16--22. Google ScholarDigital Library
Index Terms
- Self-improving algorithms for delaunay triangulations
Recommendations
Conforming Delaunay triangulations in 3D
SCG '02: Proceedings of the eighteenth annual symposium on Computational geometryWe describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC.The algorithm has been implemented, and yields in practice a relatively small number of Steiner points due to the fact ...
Generating well-shaped Delaunay meshed in 3D
SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithmsA triangular mesh in 3D is a decomposition of a given geometric domain into tetrahedra. The mesh is well-shaped if the aspect ratio of every of its tetrahedra is bounded from above by a constant. It is Delaunay if the interior of the circum-sphere of ...
Minimal Delaunay Triangulations of Hyperbolic Surfaces
AbstractMotivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we show that every hyperbolic surface of genus g has a simplicial Delaunay triangulation with O(g)...
Comments