eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-11-28
25:1
25:14
10.4230/LIPIcs.ISAAC.2019.25
article
Minimum-Width Double-Strip and Parallelogram Annulus
Bae, Sang Won
1
https://orcid.org/0000-0002-8802-4247
Division of Computer Science and Engineering, Kyonggi University, Suwon, Korea
In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annulus that encloses a given set of n points in the plane. A double-strip is a closed region in the plane whose boundary consists of four parallel lines and a parallelogram annulus is a closed region between two edge-parallel parallelograms. We present several first algorithms for these problems. Among them are O(n^2) and O(n^3 log n)-time algorithms that compute a minimum-width double-strip and parallelogram annulus, respectively, when their orientations can be freely chosen.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol149-isaac2019/LIPIcs.ISAAC.2019.25/LIPIcs.ISAAC.2019.25.pdf
geometric covering
parallelogram annulus
two-line center
double-strip