Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0706.4161

The Domino Problem of the Hyperbolic Plane Is Undecidable

Maurice Margenstern
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is undecidable for the Euclidean plane, initially proved by Robert Berger in 1966.

Explore related subjects

cs.CGcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maurice Margenstern. 2007-06-28. The Domino Problem of the Hyperbolic Plane Is Undecidable. https://arxiv.org/abs/0706.4161

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Covering Planar Lattices with Interior-Disjoint Unit Disks

We study an infinite variant of the coin-covering problem for periodic point sets in the plane. Given a point set of spacing $d$, we ask whether all of its points can be covered by pairwise non-overlapping unit disks. We consider the triangular lattice, the square lattice, and the honeycomb point set, and construct periodic motif patterns that certify several intervals of coverable spacings. For the triangular lattice, our constructions include single-family patterns with vertex, face, and off-lattice realizing centers, as well as multi-family patterns. For the honeycomb point set, additional native motifs fill gaps left by the triangular-lattice constructions. For the square lattice, we revisit the constructions of Alm et al., identify an unintended overlap in one motif realization, and give new patterns that recover part of the affected interval and establish an additional coverability interval.

cs.CG↗
arXiv2026

Restless Guards: Robust Guarding of Polyominoes

The art gallery problem is a fundamental problem whose practical applications have inspired numerous variants. In this work, we investigate a setting in which full coverage of the gallery shall be ensured despite locational uncertainty of the guards. We study this problem for polyominoes under rectangular visibility, where a $k$-restless guard assigned to a cell may move to any cell within distance at most $k$. While all polyominoes are guardable for $k\in\{0, 1\}$, the same is not true for all $k\geq 2$. However, for a given polyomino $P$ and integer $k$, we present an algorithm that identifies a $k$-restless guard set of $P$ in polynomial time, or decides that no such set exists. For the cases $k\in\{0,1\}$, where $k$-restless guard sets always exist, we provide tight worst-case bounds on the number of $k$-restless guards that are always sufficient and sometimes necessary to guard a hole-free polyomino with $n$ vertices or $m$ cells. Moreover, we show that computing a minimum guard set is NP-hard. Complementing the hardness, we provide polynomial-time algorithms for solving the problem optimally for histograms, and leverage this to obtain a $20k$-approximation for polyominoes without holes.

cs.CG↗
arXiv2026

VoroDuce: Massively Parallel 3D Voronoi Simplification with Volume-Aware Edge Collapse

3D Voronoi diagrams provide a powerful mathematical framework for representing volumetric functions and geometry with applications to Materials Science, Biology, Simulation and Astrophysics. However, accurately resolving fine structures often requires millions of cells, imposing severe computational and memory constraints. Traditional mesh decimation or point cloud simplification techniques fail to account for the effects re-meshing has on neighbouring cells. In this work, we formalize the Voronoi reduction problem and propose a greedy edge-collapsing algorithm on the dual Delaunay tetrahedralisation that accounts for changes in the local geometry. Further, we demonstrate a novel volumetric error approximation technique that models convex cell intersections as truncated prismatoids, circumventing computationally prohibitive exact volume calculations and enabling massive GPU parallelization. Evaluations across Synthetic, Medicine and Material Science data demonstrate that VoroDuce decimates models with up to a million primitives, successfully compressing the representation while preserving the underlying data better than naive decimation approaches.

cs.CG↗