DocumentCode :
1889353
Title :
Voronoi and Delaunay Tilings for Lattices
Author :
Erdahl, Robert
Author_Institution :
Queen´´s Univ., Kingston, ON
fYear :
2006
fDate :
2-5 July 2006
Firstpage :
6
Lastpage :
6
Abstract :
Summary form only given. In this paper the author considers two outstanding problems in the theory of Delaunay and Voronoi tilings for lattices. There is a new classification problem that has arisen from a new structure theorem. Sergei Ryshkov proved that: The Minkowski sum of two Voronoi polytopes is a Voronoi polytope, if and only if the corresponding Delaunay tilings are commensurate. This result raises the question of classifying all Minkowski irreduciable Voronoi poloytopes-the dual description is to determine all edge forms in Voronoi´s theory of lattice types. The author describes the first steps that have been taken in this direction.
Keywords :
computational geometry; lattice theory; mesh generation; pattern classification; type theory; Delaunay tiling; Voronoi polytope; Voronoi tiling; classification problem; lattice type; structure theorem; Lattices; Tiles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Voronoi Diagrams in Science and Engineering, 2006. ISVD '06. 3rd International Symposium on
Conference_Location :
Banff, Alberta, BC
Print_ISBN :
0-7695-2630-6
Type :
conf
DOI :
10.1109/ISVD.2006.37
Filename :
4124796
Link To Document :
بازگشت