4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) A New Algorithm in Geometry of Numbers University of Glamorgan, Pontypridd, Wales July 09-July 11 ISBN: 0-7695-2869-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.6
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method [Du05]. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.
Citation:
Mathieu Dutour, Konstantin Rybnikov, "A New Algorithm in Geometry of Numbers," isvd, pp.182-188, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||