Minimum area circumscribing Polygons
- 1 August 1985
- journal article
- research article
- Published by Springer Nature in The Visual Computer
- Vol. 1 (2), 112-117
- https://doi.org/10.1007/bf01898354
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure ProblemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An optimal algorithm for finding minimal enclosing trianglesJournal of Algorithms, 1986
- Finding the smallest triangles containing a given convex polygonJournal of Algorithms, 1985
- Finding Extremal PolygonsSIAM Journal on Computing, 1985
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area additionComputer Vision, Graphics, and Image Processing, 1983
- On a general method for maximizing and minimizing among certain geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Determining the minimum-area encasing rectangle for an arbitrary closed curveCommunications of the ACM, 1975