2000 character limit reached
The Delaunay tessellation in hyperbolic space
Published 22 Aug 2013 in math.GT | (1308.4899v3)
Abstract: The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and versions (necessarily modified from the Euclidean setting) of the empty circumspheres condition and geometric duality with the Voronoi tessellation are proved. Some pathological examples of infinite, non lattice-invariant sets are exhibited.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.