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

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Bounding the area of a centered dual two-cell below, given lower bounds on its side lengths
    scientific article

      Statements

      Bounding the area of a centered dual two-cell below, given lower bounds on its side lengths (English)
      0 references
      10 May 2017
      0 references
      For any locally finite set \(S\) in the hyperbolic plane a new tesselation called the centered dual compex of \(S\) is introduced. Two-cells of this complex are obtained by grouping some cells of the Delaunay tesselation of \(S\). Let \(C\) be a compact \(n\)-edged two-cell from the centered dual complex. Then the main result of the paper is an effectively computable lower bound for the area of \(C\), given in the terms of its edge lengths. This estimation is quite complicated and for \(n\leq 9\) the author presents a computer program for calculating the estimate. Also some numerical examples are discussed.
      0 references
      hyperbolic surface
      0 references
      Delaunay triangulation
      0 references
      effective algorithm
      0 references
      0 references
      0 references

      Identifiers