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

DOI10.1016/0024-3795(83)80008-1zbMATH Open0533.51008OpenAlexW2080937655MaRDI QIDQ789728FDOQ789728

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

Recommendations

• scientific article; zbMATH DE number 3874104
• 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

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)

Cites Work

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

Cited In (15)

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

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)