Abstract
We show that the smallestk-gon circumscribing a convexn-gon can be computed inO(n 2 logn logk) time.
Similar content being viewed by others
References
Boyce JE, Dobkin DP, Drysdale RL, Guibas LJ (1985) Finding extremal polygons. SIAM J Comp 14:134–147
Chazelle BM (1985) Approximation and decomposition of shapes, In: Yap CK, Schwartz J (eds) Advances in Robotics. Vol 1. Lawrence O'Erlbaum Inc.
Chang JS, Yap CK (1984) A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. Proc. of the 25-th Annual Symposium on the Foundations of Computer Science. pp 408–419
DePano A (1984) Onk-envelopes and shared edges. Technical Report. Department of Electric Engineering and Computer Science. The Johns Hopkins University
DePano A, Aggarwal A (1984) Finding restricted K-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing
Dobkin DP, Snyder L (1979) On a general method for maximizing and minimizing among certain geometric problems. Proceedings of the Twentieth Annual Symposium on the Foundations of Computer Science. pp 7–19
Dobkin DP, Drysdale RL, Guibas LJ (1983) Finding smallest polygons In: Preparata FP (ed) Advances in Computing Research. Jai Press. pp 181–214
Dori D, Ben-Bessat M (1983) Circumscribing a convex polygon with polygon of fewer sides with minimal area addition. Comput Vision Graph Image Proc 24:131–159
Freeman H, Shapira R (1975) Determining the minimum area encasing a package. CACM 18:409–413
Klee V, Laskowski MC (1985) Finding the smallest triangles containing the given polygon' J Algorithms
O'Rourke J (1984) Counterexamples to a minimal circumscription algorithm. Manuscript The Johns Hopkins University
O'Rourke J, Aggarwal A, Madilla S, Baldwin M (1985) An optimal algorithm for finding minimal enclosing triangles. J Algorithms
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aggarwal, A., Chang, J.S. & Yap, C.K. Minimum area circumscribing Polygons. The Visual Computer 1, 112–117 (1985). https://doi.org/10.1007/BF01898354
Issue Date:
DOI: https://doi.org/10.1007/BF01898354