On minimum-area hulls

Algorithmica (New York)

Volumn 21, Issue 1, 1998, Pages 119-136

  Arkin, E M ^a   Chiang, Y J ^a   Held, M ^b   Mitchell, J S B ^a   Sacristan, V ^c   Skiena, S S ^a   Yang, T C ^d  

^a Stony Brook University   (United States)

^b UNIVERSITY OF SALZBURG   (Austria)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d Kyungsung University   (South Korea)

Author keywords

3SUM Hardness; Computational geometry; Design and analysis of algorithms; Lower bounds; Minimum area hulls; Monotone polygons; Star shaped polygons

Indexed keywords

EID: 0010466489     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009204     Document Type: Article

References (23)

1. E. M. Arkin, S. Khuller, and J. S. B. Mitchell. Geometric knapsack problems. Algorithmica, 10:399-427, 1993.
2. M. J. Atallah. Computing the convex hull of line intersections. J. Algorithms, 7:285-288, 1986.
3. J. S. Chang. Polygon optimization problems. Report 240, Computer Science Division, New York University, New York, 1986.
4. J. S. Chang and C. K. Yap. A polynomial solution for the potato-peeling problem. Discrete Comput. Geom., 1:155-182, 1986.
5. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. In Proc. 18th Internat. Colloq. Automata Lang. Program., volume 510 of Lecture Notes in Computer Science, pages 661-673. Springer-Verlag, Berlin, 1991.
6. B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. Discrete Comput. Geom., 4:551-581, 1989.
7. K. Daniels. The restrict/evaluate/subdivide paradigm for translational containment. In Proc. Fifth MSI Stony Brook Workshop on Computational Geometry, 1995.
8. K. Daniels and V. Milenkovic. Personal communication, 1995.
9. K. Daniels and V. J. Milenkovic. Multiple translational containment. Part I: An approximation algorithm. Algorithmica, 19:148-182, 1997.
10. D. Eppstein, M. Overmars, G. Rote, and G. Woeginger. Finding minimum area k-gons. Discrete Comput. Geom., 7:45-58, 1992.
11. J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. In Proc. 34th Ann. IEEE Symp. Found. Comput. Sci., pages 528-536, 1993.
12. R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C. K. Yap. Simultaneous inner and outer approximation of shapes. Algorithmica, 8:365-389, 1992.
13. 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185, 1995.
14. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
15. Z. Li. Compaction algorithms for non-convex polygons and their applications. Ph.D. Thesis, Division of Applied Sciences, Harvard University, 1994.
16. Z. Li and V. Milenkovic. A compaction algorithm for non-convex polygons and its application. In Proc. 9th Ann. ACM Symp. Comput. Geom., pages 153-162, 1993.
17. J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Technical Report, Fakultät für Informatik, Otto-von-Guericke-Universität, Magdeburg, January 1997.
18. V. Milenkovic, K. Daniels, and Z. Li. Automatic marker making. In Proc. 3rd Canad. Conf. Comput. Geom., pages 243-246, 1991.
19. V. Milenkovic, K. Daniels, and Z. Li. Placement and compaction of nonconvex polygons for clothing manufacture. In Proc. 4th Canad. Conf. Comput. Geom., pages 236-243, 1992.
20. D. M. Mount and R. Silverman. Packing and covering the plane with translates of a convex polygon. J. Algorithms, 11:564-580, 1990.
21. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
22. G. T. Toussaint and H. ElGindy, A counterexample to an algorithm for computing monotone hulls of simple polygons. Pattern Recognition Lett., 1:219-222, 1983.
23. G. T. Toussaint. A linear-time algorithm for solving the strong hidden-line problem in a simple polygon. Pattern Recognition Lett., 4:449-451, 1986.