Space sweep solves intersection of convex polyhedra

DOI10.1007/BF00271644zbMath0553.68034OpenAlexW2094793205MaRDI QIDQ759486

Stefan Hertel, Martti Mäntylä, Jurg Nievergelt, Kurt Mehlhorn

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00271644

zbMATH Keywords

computational geometryconvex polyhedraspace-sweep algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (3) dimensions (including convex surfaces) (52A15) Polytopes and polyhedra (52Bxx)

Related Items (3)

An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions ⋮ An approximation algorithm for box abstraction of transition systems on real state spaces ⋮ THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS

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.

This page was built for publication: Space sweep solves intersection of convex polyhedra