Translational polygon containment and minimal enclosure using Linear Programming Based Restriction

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

We introduce and analyze a new technique Linear Programming Based Restriction (LP Restriction) for solving translational containment and enclosure problems. The containment task is to translate k m-gons into a n-gon container. The enclosure task is to translate k m-gons into a minimum area n-gon which is convex with fixed orientation edges. All running times are based on an assumption of fixed k and are asymptotic in m and n. Lower bounds are proved for containment in a nonconvex container: Ω((mn)2k) for nonconvex polygons and Ω(nk) for convex polygons. LP restriction achieves upper bound O((m2 + mn)2k log n) for nonconvex polygons and O((mn)k log n) for convex polygons. The former almost matches the lower bound, and the latter does also for constant m. For arbitrary m and k > 3, the latter is faster than any other known algorithm for translational containment of convex polygons. A proof is given that the area function for fixed-angle convex polygons is Lorentzian. Enclosure algorithms based on this result have running times O((m2 + n)2k-2(n + log m)) for nonconvex polygons and O((m + n)2k(n + log m)) or O(mk-1(n2k+1 + log m)) for convex polygons. We are not aware of any previous running times for k-polygon minimum area enclosure. Other containment and enclosure results are given. LP restriction demonstrates a useful combination of mathematical programming and computational geometry which may be a paradigm for solving other tasks. We show that the containment and enclosure algorithms are useful in industry. Software based on LP restriction has been licensed to industry, and it is the fastest available solution to translational containment and enclosure for nonconvex polygons.

Original languageEnglish (US)
Title of host publicationProceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996
PublisherAssociation for Computing Machinery
Pages109-118
Number of pages10
ISBN (Electronic)0897917855
DOIs
StatePublished - Jul 1 1996
Event28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States
Duration: May 22 1996May 24 1996

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129452
ISSN (Print)0737-8017

Conference

Conference28th Annual ACM Symposium on Theory of Computing, STOC 1996
CountryUnited States
CityPhiladelphia
Period5/22/965/24/96

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Translational polygon containment and minimal enclosure using Linear Programming Based Restriction'. Together they form a unique fingerprint.

  • Cite this

    Milenkovic, V. J. (1996). Translational polygon containment and minimal enclosure using Linear Programming Based Restriction. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996 (pp. 109-118). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129452). Association for Computing Machinery. https://doi.org/10.1145/237814.237840