Revisit of Minimum-area Enclosing Rectangle of a Convex Polygon

The problem of minimum-area enclosing rectangle of a convex polygon was first studied in [1] in 1975. We revis it this problem by providing a new complete proof via the elementary calculus and the method of rotating calipers [4], [5], [7] with transparent existence condition not revealed explicitly...

Full description

Saved in:
Bibliographic Details
Published in2018 5th International Conference on Control, Decision and Information Technologies (CoDIT) pp. 1051 - 1056
Main Authors Yin-Ting Lin, Jing-Sin Liu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2018
Subjects
Calculus
Cognition
Geometry
Information technology
Lattices
Trajectory
Two dimensional displays
Online AccessGet full text

Cover

More Information
Summary:The problem of minimum-area enclosing rectangle of a convex polygon was first studied in [1] in 1975. We revis it this problem by providing a new complete proof via the elementary calculus and the method of rotating calipers [4], [5], [7] with transparent existence condition not revealed explicitly in [1] mainly based on geometric reasoning. The existence of minimum-area enclosing rectangle is mathematically due to monotonicy of area of enclosing rectangle with respect to the rotation angle defining its configuration relative to an initial enclosing rectangle.
ISSN:2576-3555
DOI:10.1109/CoDIT.2018.8394943