Skip to main content
SpringerLink
Log in

Minimum area circumscribing Polygons

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

We show that the smallestk-gon circumscribing a convexn-gon can be computed inO(n 2 logn logk) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boyce JE, Dobkin DP, Drysdale RL, Guibas LJ (1985) Finding extremal polygons. SIAM J Comp 14:134–147

    Article  MATH  MathSciNet  Google Scholar 

  2. Chazelle BM (1985) Approximation and decomposition of shapes, In: Yap CK, Schwartz J (eds) Advances in Robotics. Vol 1. Lawrence O'Erlbaum Inc.

    Google Scholar 

  3. 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

  4. DePano A (1984) Onk-envelopes and shared edges. Technical Report. Department of Electric Engineering and Computer Science. The Johns Hopkins University

  5. DePano A, Aggarwal A (1984) Finding restricted K-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing

  6. 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

  7. Dobkin DP, Drysdale RL, Guibas LJ (1983) Finding smallest polygons In: Preparata FP (ed) Advances in Computing Research. Jai Press. pp 181–214

  8. 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

    Article  Google Scholar 

  9. Freeman H, Shapira R (1975) Determining the minimum area encasing a package. CACM 18:409–413

    MATH  MathSciNet  Google Scholar 

  10. Klee V, Laskowski MC (1985) Finding the smallest triangles containing the given polygon' J Algorithms

  11. O'Rourke J (1984) Counterexamples to a minimal circumscription algorithm. Manuscript The Johns Hopkins University

  12. O'Rourke J, Aggarwal A, Madilla S, Baldwin M (1985) An optimal algorithm for finding minimal enclosing triangles. J Algorithms

Download references

Author information

Authors and Affiliations

  1. IBM T.J. Watson Center, P.O. Box 218, 10598, Yorktown Heights, New York, USA

    Alok Aggarwal

  2. Courant Institute of Mathematical Sciences, 251 Mercer Street, 10012, New York, New York, USA

    J. S. Chang & Chee K. Yap

Authors
  1. Alok Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. S. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chee K. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01898354

Key words

Search

Navigation