The Lonely Vertex Problem
Metric Geometry
2007-10-26 v1
Abstract
In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.
Keywords
Cite
@article{arxiv.0710.4870,
title = {The Lonely Vertex Problem},
author = {D. Frettlöh and A. Glazyrin},
journal= {arXiv preprint arXiv:0710.4870},
year = {2007}
}
Comments
8 pages, 2 figures