loading...
A New Algorithm in Geometry of Numbers
University of Glamorgan, Pontypridd, Wales July 09-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.64th International Symposium on Vorono ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mathieu Dutour, Rudjer Boskovic Institute, Croatia
Konstantin Rybnikov, University of Massachusetts at Lowell, USA
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.