Finding the largest area axis-parallel rectangle in a polygon

Computational Geometry: Theory and Applications

Volumn 7, Issue 1-2, 1997, Pages 125-148

  Daniels, Karen ^a   Milenkoviec, Victor ^c   Roth, Dan ^b  

^a HARVARD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c NONE

Author keywords

Fast matrix searching; Geometric optimization; Rectangles

Indexed keywords

EID: 0000477815     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00041-0     Document Type: Article

References (31)

1. A. Aggarwal, M.M. Klawe, S. Moran, P. Shor and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987) 195-208.
2. A. Aggarwal and S. Suri, Fast algorithms for computing the largest empty rectangle, in: Proc. 3rd ACM Symp. Comput. Geom. (1987) 278-290.
3. A. Aggarwal and S. Suri, Fast algorithms for computing the largest empty rectangle, Personal communication (1992).
4. A. Aggarwal and J. Wein, Computational Geometry Lecture Notes for MIT 18.409 (1988).
5. N. Amenta, Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem, in: Proc. 10th ACM Symp. Comput. Geom. (1994) 340-347.
6. F. Aurenhammer, Voronoi diagrams - a survey of a fundamental geometric data structure, ACM Computing Surveys 23(3) (1991) 345-406.
7. J.S. Chang and C.K. Yap, A polynomial solution for the potato-peeling problem, Discrete Comput. Geom. 1 (1986) 155-182.
8. B. Chazelle, A theorem on polygon cutting with applications, in: Proc. 23rd IEEE Symp. Found. Comp. Sci. (1982) 339-349.
9. B. Chazelle, R.L. Drysdale III and D.T. Lee, Computing the largest empty rectangle, SIAM J. Comput. 15 (1986) 300-315.
10. L.P. Chew and R.L. Drysdale III, Voronoi diagrams based on convex distance functions, in: Proc. 1st ACM Symp. Comput. Geom. (1985) 235-244.
11. K. Daniels and V.J. Milenkovic, Limited gaps, in: Proc. 6th Canad. Conf. Comput. Geom. (1994) 225-230.
12. K. Daniels, V.J. Milenkovic and D. Roth, Finding the largest rectangle in several classes of polygons, Technical Report 22-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University (1995).
13. N. DePano, Y. Ke and J. O'Rourke, Finding largest inscribed equilateral triangles and squares, in: Proc. 25th Allerton Conference on Communications, Control and Computing (1987) 869-878.
14. H. Edelsbrunner and E.P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Trans. on Graphics 9 (1990) 66-104.
15. L. 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 (1987) 209-233.
16. F. Hwang, An O(n log n) algorithm for rectilinear minimal spanning trees, J. ACM 26 (1979) 177-182.
17. M.M. Klawe and D.J. Kleitman, An almost linear time algorithm for generalized matrix searching, SIAM J. Discr. Math. 3(1) (1990) 81-97.
18. D. Lee, Medial axis transformation of a planar shape, IEEE Trans. Pattern Anal. Machine Intell. 4 (1982) 363-369.
19. ∞) metrics with 2-dimensional storage applications, SIAM J. Comput. 9(1) (1980) 200-211.
20. M. McKenna, J. O'Rourke and S. Suri, Finding the largest rectangle in an orthogonal polygon, in: Proc. 23rd Allerton Conference on Communication, Control and Computing (1985) 486-495.
21. E. Melissaratos and D. Souvaine, On solving geometric optimization problems using shortest paths, in: Proc. 6th ACM Symp. Comput. Geom. (1990) 350-359.
22. V.J. Milenkovic, K. Daniels and Z. Li, Automatic marker making, in: Proc. 3rd Canad. Conf. Comput. Geom. (1991).
23. V.J. Milenkovic, K. Daniels and Z. Li, Placement and compaction of nonconvex polygons for clothing manufacture, in: Proc. 4th Canad. Conf. Comput. Geom. (1992) 236-243.
24. A. Naamad, W.L. Hsu and D.T. Lee, On the maximum empty rectangle problem, Discrete Appl. Math. 8 (1984) 267-277.
25. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford University Press, Cambridge, 1987).
26. J. O'Rourke, Computational Geometry in C (Cambridge University Press, Cambridge, 1994).
27. M.H. Overmars and D. Wood, On rectangular visibility, J. Algorithms 9 (1988) 372-390.
28. F. Preparata and M. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
29. S. Schuierer, G.J.E. Rawlins and D. Wood, A generalization of staircase visibility, in: Proc. 3rd Canad. Conf. Comput. Geom. (1991) 96-99.
30. D. Wood and C.K. Yap, The orthogonal convex skull problem, Discrete Comput. Geom. 3 (1988) 349-365.
31. C.K. Yap, A geometric consistency theorem for a symbolic perturbation scheme, J. Comput. Syst. Sci. 40 (1990) 2-18.