DocumentCode
3173200
Title
Voronoi Diagrams on Periodic Graphs
Author
Fu, Norie ; Imai, Hiroshi ; Moriyama, Sonoko
Author_Institution
Dept. of Comput. Sci., Univ. of Tokyo, Tokyo, Japan
fYear
2010
fDate
28-30 June 2010
Firstpage
189
Lastpage
198
Abstract
A periodic graph models various natural and artificial periodic patterns with repetitions of a given static graph, and have vast applications in crystallography, scheduling, VLSI circuits and systems of uniform recurrence equations. This paper considers a graph Voronoi diagram for a given subset of vertices on a periodic graph. The simplest two-dimensional periodic graph is a square lattice, and the Voronoi diagram on the lattice geometrically corresponds to the L1 Voronoi diagram in the plane. We extend this geometric relation for the two-dimensional periodic graphs, including the honeycomb lattice, kagome lattice and two-dimensional periodic graph with small static graph. For these graphs, the graph Voronoi diagram can be represented implicitly by Voronoi diagrams with respect to appropriate convex-distance functions with extra elaborations.
Keywords
VLSI; computational geometry; crystallography; scheduling; VLSI circuit; Voronoi diagram; convex distance function; crystallography; periodic graph model; scheduling; static graph; uniform recurrence equation; Application software; Computer science; Crystallography; Crystals; Data structures; Difference equations; Lattices; Linear programming; Nearest neighbor searches; Very large scale integration; graph Voronoi diagrams; periodic graphs; shortest paths;
fLanguage
English
Publisher
ieee
Conference_Titel
Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on
Conference_Location
Quebec, QC
Print_ISBN
978-1-4244-7606-0
Electronic_ISBN
978-1-4244-7605-3
Type
conf
DOI
10.1109/ISVD.2010.26
Filename
5521424
Link To Document