Share Email Print

Proceedings Paper

Minimum enclosures with specified angles
Author(s): David M. Mount; Ruth Silverman
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Given a convex polygon P, an m-envelope is a convex m-sided polygon that contains P. Given any convex polygon P, and any sequence of m >= 3 angles A equals ((alpha) 1, (alpha) 2, ..., (alpha) m) we consider the problem of computing the minimum area m- envelope for P whose counterclockwise sequence of exterior angles is given by A. We show that such envelopes can be computed in O(nm log m) time. The main result on which the correctness of the algorithm rests is a flushness condition stating that for any locally minimum enclosure with specified angles, one of its sides must be collinear with one of the sides of P.

Paper Details

Date Published: 9 April 1993
PDF: 12 pages
Proc. SPIE 1832, Vision Geometry, (9 April 1993); doi: 10.1117/12.142158
Show Author Affiliations
David M. Mount, Univ. of Maryland/College Park (United States)
Ruth Silverman, Univ. of the District of Columbia and Univ. of Maryland (United States)

Published in SPIE Proceedings Vol. 1832:
Vision Geometry
Robert A. Melter; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top