Efficient approximation of convex polygons

International Journal of Computational Geometry and Applications

Volumn 10, Issue 5, 2000, Pages 445-452

  Lopez, Mario A ^a   Reisner, Shlomo ^b  

^a UNIVERSITY OF DENVER   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation algorithms; Convex polygon

Indexed keywords

EID: 0034365395     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000267     Document Type: Article

References (17)

1. A. Aggarwal, J. Chang and C. Yap. Minimum area circumscribing polygons. Visual Computer 1 (1985), 112-117.
2. N. Amenta. Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly theorem. Proc. 10th Annu. ACM Sympos. on Computational Geometry (1994), 340-347.
3. K. Ball. Volume ratios and a reverse isoperimetric inequality. J. London Math. Soc. 44 (1991), 351-359.
4. F. Behrend. Über einige Affininvarianten Konvexer Beriche. Math. Ann. 113 (1937), 713-747.
5. J. Boyce, D. Dobkin, R. Drysdale III and L. Guibas. Finding extremal polygons. SIAM Journal on Computing 14 (1985), 134-147.
6. D. Dori and M. Ben-Bassat. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Computer Vision, Graphics and Image Processing 24 (1983), 131-159.
7. L. Fejes Tóth. Lagerungen in der Ebene, auf der Kugel und in Raum. Springer-Verlag, 1953, 1972.
8. H. Freeman and R. Shapira. Determining the minimum-area encasing rectangle for an arbitrary closed curve. Communications of the ACM 18 (1975), 409-413.
9. W. Gustin. An isoperimetric minimax. Pacific J. Math. 3 (1953), 403-405.
10. V. Klee and M. Laskowski. Finding the smallest triangles containing the given polygon. Journal of Algorithms 6 (1985), 359-375.
11. M. Longinetti. Una Proprietà di Massimo del Poligoni Affinemente Regolari. Rend. Circ. Mat. Palermo, Ser. II, 34 (1985), 448-459.
12. M. Longinetti. An isoperimetric inequality for convex polygons and convex sets with the same symmetrals. Geometriae Dedicata 20 (1986), 27-41.
13. J. O'Rourke. Counterexamples to a minimal circumscription algorithm. Computer Vision, Graphics and Image Processing 30 (1985), 364-366.
14. J. O'Rourke, A. Aggarwal, S. Madilla and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. Journal of Algorithms 7 (1985), 258-269.
15. A. Renyi and R. Sulanke. Über die konvexe Hülle von n zufällig gewählten Punkten. Zeitschrift für Wahrscheinlichkeitstheorie 2 (1963), 75-84.
16. C. Schwarz, J. Teich, A. Vainshtein, E. Welzl and B. Evans. Minimal enclosing parallelogram with applications. Proc. 11th Ann. ACM Sympos. on Computational Geometry (1995), C34-C35.
17. G. T. Toussaint. Solving geometric problems with the rotating calipers. Proc. IEEE MELECON '83 (1983).