Bounding the area of a centered dual two-cell below, given lower bounds on its side lengths

zbMATH Open1366.57008arXiv1508.07978MaRDI QIDQ526161FDOQ526161

Jason DeBlois

Publication date: 10 May 2017

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

Abstract: Suppose $C$ is a compact, $n$-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an effectively computable lower bound on the area of $C$, given an $n$-tuple of positive real numbers bounding the lengths of the edges of $C$ below. The ancillary materials contain Python code implementing (for $n<10$) an algorithm to compute this bound. For geometrically reasonable edge length bounds, we expect the given area bound to be sharp or near-sharp.

Full work available at URL: https://arxiv.org/abs/1508.07978

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Delaunay triangulationhyperbolic surfaceeffective algorithm

Mathematics Subject Classification ID

General geometric structures on low-dimensional manifolds (57M50) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

This page was built for publication: Bounding the area of a centered dual two-cell below, given lower bounds on its side lengths

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