Compact voronoi diagrams for moving convex polygons

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

Volumn 1851, Issue , 2000, Pages 339-352

  Guibas, Leonidas J ^a   Snoeyink, Jack ^b   Zhang, Li ^a  

^a Stanford University   (United States)

^b Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; MOTION PLANNING;

BOUNDED DEGREE; COLLISION DETECTION; CONVEX POLYGON; DELAU-NAY TRIANGULATIONS; KEY FEATURE; KINETIC DATA STRUCTURE; OUTPUT-SENSITIVE; VORONOI DIAGRAMS;

GEOMETRY;

EID: 29544431731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (11)

1. J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang. Kinetic collision detection for two simple polygons. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pages 102-111, 1999.
2. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 747-756, 1997.
3. Jeff Erickson, L. J. Guibas, Jorge Stoff, and L. Zhang. Separation-sensitive kinetic collision detection for convex objects. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1999.
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 Internat. Workshop Graph-Theoret. Concepts Comput. Sci., volume 570 of Lecture Notes Comput. Sci., pages 113-125. Springer-Verlag, 1992.
5. L. Guibas and L. Zhang. Euclidean proximity and power diagram. In Proc. 10th Canadian Conference on Computatoinal Geometry, 1998.
6. D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 110-119, 1992.
7. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
8. M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In Proc. IEEE Internat. Conf. Robot. Autom., volume 2, pages 1008-1014, 1991.
9. B. Mirtich. V-Clip: fast and robust polyhedral collision detection. Technical Report TR-97-05, Mitsubishi Electrical Research Laboratory, 1997.
10. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom., 15:73-105, 1996.
11. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990.