A New Algorithm in Geometry of Numbers (CROSBI ID 39796)
Prilog u knjizi | izvorni znanstveni rad
Podaci o odgovornosti
Dutour Sikirić, Mathieu ; Rybnikov, Konstantin
engleski
A New Algorithm in Geometry of Numbers
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. 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.
Delaunay polytopes, flipping, Erdahl cone, algorithm
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
182-188.
objavljeno
Podaci o knjizi
Gold, Chris
Pontypridd: Institute of Electrical and Electronics Engineers (IEEE)
2009.
0-7695-2869-4