Author:
Chiang Yi-Jen,Tamassia Roberto
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Nancy M. Amato. An optimal algorithm for finding the separation of simple polygons. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 48–59. Springer-Verlag, 1993.
2. E. M. Arkin, J. S. B. Mitchell, and S. Suri. Optimal link path queries in a simple polygon. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 269–279, 1992.
3. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485–524, 1991.
4. B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34:1–27, 1987.
5. Y.-J. Chiang, F. P. Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 44–53, 1993.