Simple Partitions of Space

DOI10.2307/2689466MaRDI QIDQ4188366zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

• On the division of space by topological hyperplanes
• A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
• The complexity of cells in three-dimensional arrangements
• Edge-skeletons in arrangements with applications
• 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
• Geometria combinatoria e geometrie finite
• Divisions of Space by Parallels
• The pizza-cutter's problem and Hamiltonian paths
• Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form

This page was built for publication: Simple Partitions of Space

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