Space sweep solves intersection of convex polyhedra

DOI10.1007/BF00271644MaRDI QIDQ759486zbMATH OpenOpenAlexFDO

Authors Stefan Hertel, Martti Mäntylä, K. Mehlhorn, Jurg Nievergelt

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) Polytopes and polyhedra (52Bxx) Convex sets in (3) dimensions (including convex surfaces) (52A15)

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

Cites work

• scientific article; zbMATH DE number 3778747 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• A linear algorithm for determining the separation of convex polyhedra
• 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
• Eulers Charakteristik und kombinatorische Geometrie.
• Finding the intersection of two convex polyhedra
• Plane-sweep algorithms for intersecting geometric figures

Cited in

(7)

• An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• 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
• scientific article; zbMATH DE number 176571 (Why is no real title available?)
• Computing convolutions by reciprocal search
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron

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)