Separating a polyhedron by one translation from a set of obstacles

DOI10.1007/3-540-50728-0_44OpenAlexW1587171952MaRDI QIDQ6199465

Otto Nurmi, Jörg-Rüdiger Sack

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On lines missing polyhedral sets in 3-space

Cites Work

• Unnamed Item
• Unnamed Item
• Translation separability of sets of polygons
• On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A fast algorithm for the Boolean masking problem
• Optimal Search in Planar Subdivisions
• Convex hulls of finite sets of points in two and three dimensions

This page was built for publication: Separating a polyhedron by one translation from a set of obstacles