A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).

DOI10.1007/BF02241747zbMath0467.51019MaRDI QIDQ1155863

S. H. Smith

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

division of spacesalgorithm for geometry

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polyhedra and polytopes; regular figures, division of spaces (51M20) Software, source code, etc. for problems pertaining to geometry (51-04) Software, source code, etc. for problems pertaining to linear algebra (15-04) Polytopes and polyhedra (52Bxx)

Related Items

Shadow-boundaries of convex bodies ⋮ Curvature and Flow in Digital Space ⋮ Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution ⋮ Erratum to: Arrangements of planes in space ⋮ A sweep-plane algorithm for generating random tuples in simple polytopes ⋮ A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form

Cites Work

• Unnamed Item
• Unnamed Item
• Zur Eulerschen Charakteristik allgemeiner, insbesondere konvexer Polyeder
• Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
• Erweiterter Polyedersatz und Euler-Shephardsche Additionstheoreme
• Algorithms for Reporting and Counting Geometric Intersections
• Eulers Charakteristik und die Beschränktheit konvexer Polyeder.
• Plane-sweep algorithms for intersecting geometric figures
• Platonic Divisions of Space
• Simple Partitions of Space
• On the Euler characteristic of spherical polyhedra and the Euler relation
• Eulers Charakteristik und kombinatorische Geometrie.

This page was built for publication: A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).