engleski

Perfect Delaunay polytopes

We present here the theory of perfect Delaunay polytopes, i..e ones that cannot be deformed without changing the vertex set. We make the link with the Erdahl cone explicit. This allows us to construct a Delaunay polyhedra retract in this cone. We give a Voronoi algorithm for enumerating the perfect Delaunay polytopes. We also explain the theory of covering maxima and its relation with the Erdahl cone.

Erdahl cone ; Voronoi algorithm ; retract ; covering maxima

nije evidentirano