Space sweep solves intersection of convex polyhedra
From MaRDI portal
Publication:759486
DOI10.1007/BF00271644zbMath0553.68034MaRDI QIDQ759486
Jurg Nievergelt, Kurt Mehlhorn, Stefan Hertel, Martti Mäntylä
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
52A15: Convex sets in (3) dimensions (including convex surfaces)
52Bxx: Polytopes and polyhedra
Related Items
THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS, An approximation algorithm for box abstraction of transition systems on real state spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- Finding the intersection of two convex polyhedra
- Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
- A linear algorithm for determining the separation of convex polyhedra
- Plane-sweep algorithms for intersecting geometric figures
- Eulers Charakteristik und kombinatorische Geometrie.