Translation separability of sets of polygons
From MaRDI portal
Publication:1100897
DOI10.1007/BF01952829zbMath0641.68067OpenAlexW2029462692WikidataQ62037534 ScholiaQ62037534MaRDI QIDQ1100897
Jörg-Rüdiger Sack, Frank Dehne
Publication date: 1987
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01952829
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (6)
Solving visibility and separability problems on a mesh-of-processors ⋮ On the separability of quadrilaterals in the plane by translations and rotations ⋮ Intractability of assembly sequencing: Unit disks in the plane ⋮ Separating a polyhedron by one translation from a set of obstacles ⋮ Computational geometry algorithms for the systolic screen ⋮ An optimal algorithm for one-separation of a set of isothetic polygons
Cites Work
This page was built for publication: Translation separability of sets of polygons
