Space sweep solves intersection of convex polyhedra
DOI10.1007/BF00271644zbMATH Open0553.68034OpenAlexW2094793205MaRDI QIDQ759486FDOQ759486
Stefan Hertel, Martti Mäntylä, Jurg Nievergelt, K. Mehlhorn
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00271644
Recommendations
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- Optimal detection of intersections between convex polyhedra
- Topologically sweeping an arrangement
- scientific article; zbMATH DE number 6789228
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx) Convex sets in (3) dimensions (including convex surfaces) (52A15)
Cites Work
- Title not available (Why is that?)
- A linear algorithm for determining the separation of convex polyhedra
- Plane-sweep algorithms for intersecting geometric figures
- Eulers Charakteristik und kombinatorische Geometrie.
- Finding the intersection of two convex polyhedra
- Title not available (Why is that?)
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
- Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
- Title not available (Why is that?)
Cited In (7)
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- 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
- Title not available (Why is that?)
- Computing convolutions by reciprocal search
- THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
This page was built for publication: Space sweep solves intersection of convex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759486)
