scientific article; zbMATH DE number 4049041

MaRDI QIDQ3785935zbMATH OpenFDO

Authors Frank Dehne, Jörg-Rüdiger Sack

Publication date 1987

zbMATH Keywords

computational geometryseparability problemtime complexities

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Analytic and descriptive geometry (51N99) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4121493
• scientific article; zbMATH DE number 3945379
• Separating two simple polygons by a sequence of translations
• On separating two simple polygons by a single translation
• An optimal algorithm for one-separation of a set of isothetic polygons

Cited in

(16)

• Partitioning and separating sets of orthogonal polygons
• Separating two simple polygons by a sequence of translations
• On movable separability and isotheticity
• Separating sets in interpolation and geometry
• On separating two simple polygons by a single translation
• On the complexity of one-shot translational separability.
• Separability by two lines and by nearly straight polygonal chains
• On the separability of quadrilaterals in the plane by translations and rotations
• On the mobility of bodies in ℝⁿ
• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 4121493 (Why is no real title available?)
• Translating polygons with applications to hidden surface removal
• scientific article; zbMATH DE number 7157354 (Why is no real title available?)
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• Separating a polyhedron by one translation from a set of obstacles
• An optimal algorithm for one-separation of a set of isothetic polygons

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785935)