Self-improving algorithms for delaunay triangulations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 148-155

  Clarkson, Kenneth L ^a   Seshadhri, C ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Princeton University

Author keywords

Algorithms theory

Indexed keywords

ALGORITHM MATCHES; ARBITRARY DISTRIBUTIONS; DELAUNAY; DELAUNAY TRIANGULATIONS; LOCATION DATUMS; LOW ENTROPIES; LOWER BOUNDS; OPTIMAL POINTS; RELEVANT INFORMATIONS; RUNNING TIMES;

COMPUTATIONAL GEOMETRY; CONTROL THEORY; FILE ORGANIZATION; GEODESY; INFORMATION THEORY; MARINE BIOLOGY; OPTIMIZATION; TREES (MATHEMATICS); TRIANGULATION;

DATA STRUCTURES;

EID: 57349110566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377700     Document Type: Conference Paper

References (7)

1. Ailon, N., Chazelle, B., Comandur, S., Liu, D., Self-Improving Algorithms. Proc. 17th SODA (2006). 261-270.
2. 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.
3. Arya, S., Malamatos, T., Mount, D. M., Wong, K.-C. Optimal Expected-Case Planar Point Location, SIAM J. Comput. 37, 2007, 584-610
4. Chazelle, B., An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra, SIAM J. Computing 21, 1992, 671-696.
5. Chazelle, B., Devillers, O.,Hurtado, F., Mora, M., Sacristan, V., Teillaud, M. Splitting a Delaunay Triangulation in Linear Time, Algorithmica 34, 2002, 39-46.
6. Clarkson, K., Varadarajan, K. Improved Approximation Algorithms for Geometric Set Cover Discrete and Computation Geometry 37, 2007, 43-58.
7. Matousek, J., Scidel, R., Welzl, E. How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces, Proc. 6th SOCG (1990), 16-22.