Simple Partitions of Space

DOI10.2307/2689466zbMath0403.51017OpenAlexW4248753233MaRDI QIDQ4188366

Gerald L. Alexanderson, John E. Wetzel

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/2689466

zbMATH Keywords

Arrangement of N PlanesPartitions of Space

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20)

Related Items (12)

The complexity of cells in three-dimensional arrangements ⋮ Edge-skeletons in arrangements with applications ⋮ Geometria combinatoria e geometrie finite ⋮ The Pizza-Cutter’s Problem and Hamiltonian Paths ⋮ Two-colouring inequalities for euclidean arrangements in general position ⋮ A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\). ⋮ Arrangements of planes in space ⋮ Divisions of Space by Parallels ⋮ Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution ⋮ On the division of space by topological hyperplanes ⋮ A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form ⋮ A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form

This page was built for publication: Simple Partitions of Space