Safety Zone Problem

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 538-569

  Nandy, Subhas C ^a   Bhattacharya, Bhargab B ^a   Hernàndez Barrera, Antonio ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b UNIVERSITY OF HAVANA   (Cuba)

Author keywords

Algorithm; Complexity; Convex hull; Minkowski sum; Polygon triangulation; Resizing of VLSI circuits

Indexed keywords

EID: 0347370176     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1092     Document Type: Article

References (13)

1. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991), 485-524.
2. A. Hernández-Barrera, Computing the Minkowski sum of monotone polygons, IEICE Trans. Inform. Systems E80-D, No. 2 (1996), 218-222.
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, "Computational Geometry: Algorithms and Applications," Springer-Verlag, Berlin, 1997.
4. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, Ray shooting in polygons using geodesic triangulation, in "Proceedings, 18th International Colloquium on Automata Language Programming," Lecture Notes in Computer Science, Vol. 510, pp. 661-673, Springer-Verlag, New York/Berlin, 1991.
5. F. Chin, J. Snoeyink, and C.-A. Wang, Finding the medial axis of a simple polygon in linear time, in "Proceedings, 6th Annual International Symposium on Algorithms and Computation (ISAAC 95)," Lecture Notes in Computer Science, Vol. 1004, pp. 382-391, Springer-Verlag, New York/Berlin, 1995.
6. S. Fortune, A fast algorithm for polygon containment by translation, in "Proceedings, 12th International Colloquium on Automata Language Programming," Lecture Notes in Computer Science, Vol. 194, pp. 189-198, Springer-Verlag, New York/Berlin, 1985.
7. M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan, Triangulating a simple polygon, Inform. Process. Lett. 7 (1978), 175-179.
8. R. Klein and A. Lingas, A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon, in "Proceedings, 9th Annual ACM Symposium on Computational Geometry," pp. 124-132, Association for Computing Machinery, New York, 1993.
9. D. T. Lee, On finding the convex hull of a simple polygon, Internat. J. Comp. Inform. Sci. 12, No. 2 (1983), 87-98.
10. T. Ohtsuki, "Layout Design and Verification," North-Holland, Amsterdam, 1986.
11. G. D. Ramkumar, An algorithm to compute the Minkowski sum outer face of two simple polygon, in "Proceedings, 12th Annual ACM Symposium on Computational Geometry," pp. 234-241, Association for Computing Machinery, New York, 1996.
12. R. Seidal, A simple and fast incremental randomized algorithm for computing the trapezoidal decompositions and for triangulating polygons, Comput. Geom. 1 (1991), 54-61.
13. N. Sherwani, "Algorithms for VLSI Physical Design Automation," Kluwer Academic, Boston, 1993.