Partitioning Euclidean space

DOI10.1007/BF02573966zbMath0782.51003OpenAlexW2062452294MaRDI QIDQ5919858

James H. Schmerl

Publication date: 2 September 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131263

zbMATH Keywords

partition of \(\mathbb{R}^ n\)

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Axiom of choice and related propositions (03E25)

Related Items (5)

An improvement to ``A note on Euclidean Ramsey theory ⋮ Countable partitions of Euclidean space ⋮ DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS ⋮ Chromatic numbers of algebraic hypergraphs ⋮ Avoidable algebraic subsets of Euclidean space

Cites Work

• Tetrahedron Free Decomposition of R³
• Unnamed Item

This page was built for publication: Partitioning Euclidean space