How to compute the rank of a Delaunay polytope

Details How to compute the rank of a Delaunay polytope How to compute the rank of a Delaunay polytope

2005-12-09

arxiv.org/abs/math/0512193v1

Mathematics

Combinatorics

13 pages

Scientific paper

Roughly speaking, the rank of a Delaunay polytope (first introduced in \cite{DGL92}) is its number of degrees of freedom. In \cite{DL}, 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 classical Delaunay polytopes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.

Affiliated with

Also associated with

No associations

Rating

How to compute the rank of a Delaunay polytope does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How to compute the rank of a Delaunay polytope, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to compute the rank of a Delaunay polytope will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371647