Voronoi diagrams for moving disks and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 62-74

  Karavelas, Menelaos I ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPHIC METHODS; SURVEYING; TRIANGULATION;

DELAU-NAY TRIANGULATIONS; EUCLIDEAN VORONOI DIAGRAMS; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 38849148177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_7     Document Type: Conference Paper

References (12)

1. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. J. Algorithms, 1:1–28, 1999.
2. M. Gavrilova and J. Rokne. Swap conditions for dynamic Voronoi diagrams for circles and line segments. CAGD, 16:89–106, 1999.
3. L. J. Guibas, J. Hershberger, S. Suri, and L. Zhang. Kinetic connectivity for unit disks. In Proc. 16th ACM Symp. on Computat. Geom., pages 331–339, 2000.
4. L. J. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points in the plane. In G. Schmidt and R. Berghammer, editors, Proc. 17th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 570 of LNCS, pages 113–125. Springer, 1991.
5. L. J. Guibas, J. Snoeyink, and L. Zhang. Compact Voronoi diagrams for moving convex polygons. In Magnús M. Halldórsson, editor, Proc. 7th SWAT, volume 1851 of LNCS, pages 339–352. Springer, 2000.
6. L. J. Guibas and L. Zhang. Euclidean proximity and power diagram. In Proc. 10th CCCG, 1998.
7. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. 30th ACM STOC, pages 79–89, 1998.
8. H. Imai, M. Iri, and K. Murota. Voronoi diagram in the Laguerre geometry and its applications. SIAM J. Comput., 14(1):93–105, 1985.
9. M. I. Karavelas and L. J. Guibas. Static and kinetic geometric spanners with applications. In Proc. 12th ACM-SIAM SODA, pages 168–176, 2001.
10. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
11. M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In Proc. IEEE Intern. Conf. Robot. Autom., volume 2, pages 1008–1014, 1991.
12. M. Sharir. Intersection and closest-pair problems for a set of planar discs. SIAM J. of Comput., 14(2):448–468, May 1985.