Abstract This paper is concerned with the movable-separability properties of isothetic simple polygons. Previously obtained results in this area applied only to the highly restricted class of star-shaped isothetic polygons. We introduce new classes of isothetic polygons which are substantially more general, and establish their movable-separability properties. We also define new structures called separability hulls of isothetic polygons, and introduce the notion of a jagged cross , which is a very broad subclass of isothetic simple polygons with highly interesting geometry. Elegant results on the separability-related properties of these structures are shown. Although occasional remarks on algorithmic aspects are made, the emphasis is more on structural geometric properties of isothetic polygons than on algorithmic implications, which are open for further investigation.
[1]
J. Schwartz,et al.
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"
,
1984
.
[2]
Godfried T. Toussaint,et al.
Movable Separability of Sets
,
1985
.
[3]
Jörg-Rüdiger Sack,et al.
Seperability of Sets of Polygons
,
1986,
WG.
[4]
Micha Sharir,et al.
Separating two simple polygons by a sequence of translations
,
2015,
Discret. Comput. Geom..
[5]
Michael Ian Shamos,et al.
Computational geometry: an introduction
,
1985
.
[6]
Derick Wood,et al.
An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692.
,
1985
.