A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form

DOI10.1016/0024-3795(83)80008-1MaRDI QIDQ789728zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1983

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(83)80008-1

zbMATH Keywords

Euler characteristicsimplicesKonvexringregular vertices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• Publication:3339669
• Computing Volumes of Polyhedra
• Space sweep solves intersection of convex polyhedra
• Polytope Volume Computation
• An Efficient Algorithm for Obtaining the Volume of a Special Kind of Pyramid and Application to Convex Polyhedra

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3592563 (Why is no real title available?)
• scientific article; zbMATH DE number 3297821 (Why is no real title available?)
• A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).
• Algorithms for Reporting and Counting Geometric Intersections
• Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
• Erweiterter Polyedersatz und Euler-Shephardsche Additionstheoreme
• Eulers Charakteristik und kombinatorische Geometrie.
• On the Euler characteristic of spherical polyhedra and the Euler relation
• Plane-sweep algorithms for intersecting geometric figures
• Platonic Divisions of Space
• Simple Partitions of Space
• Zur Eulerschen Charakteristik allgemeiner, insbesondere konvexer Polyeder

Cited in

(15)

• Average weights and power in weighted voting games
• scientific article; zbMATH DE number 3874104 (Why is no real title available?)
• An Efficient Algorithm for Obtaining the Volume of a Special Kind of Pyramid and Application to Convex Polyhedra
• Finding the exact volume of a polyhedron.
• A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
• Aggregate operators in constraint query languages
• Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
• A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
• Space sweep solves intersection of convex polyhedra
• Uniform generation in spatial constraint databases and applications
• Curvature and flow in digital space
• Volume of a pentahedron revisited
• Volume computation for sparse Boolean quadric relaxations
• A sweep-plane algorithm for generating random tuples in simple polytopes
• Computing Volumes of Polyhedra

This page was built for publication: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789728)