Abstract
Roughly speaking, the rank of a Delaunay polytope is its number of degrees of freedom. In [M. Deza, M. Laurent, Geometry of Cuts and Metrics, Springer Verlag, Berlin, Heidelberg, 1997], a method for computing the rank of a Delaunay polytope P , using the hypermetrics related to P , is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics, is given. This method is applied to the classical Delaunay polytopes: cross-polytopes and half-cubes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
