VORONOI DIAGRAMS - A SURVEY OF A FUNDAMENTAL GEOMETRIC DATA STRUCTURE

被引:166
作者
AURENHAMMER, F
机构
关键词
CELL COMPLEX; CLUSTERING; COMBINATORIAL COMPLEXITY; CONVEX HULL; CRYSTAL STRUCTURE; DIVIDE-AND-CONQUER; GEOMETRIC DATA STRUCTURE; GROWTH MODEL; HIGHER DIMENSIONAL EMBEDDING; HYPERPLANE ARRANGEMENT; K-SET; MOTION PLANNING; NEIGHBOR SEARCHING; OBJECT MODELING; PLANE-SWEEP; PROXIMITY; RANDOMIZED INSERTION; SPANNING TREE; TRIANGULATION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. The paper puts particular emphasis on the unified exposition of its mathematical and algorithmic properties. Finally, the paper provides the first comprehensive bibliography on Voronoi diagrams and related structures.
引用
收藏
页码:345 / 405
页数:61
相关论文
共 284 条
[71]  
CHEW LP, 1989, TR89983 CORN U DEP C
[72]  
CHEW LP, 1989, 5TH P ACM S COMP GEO, P167
[73]  
CHOW A, 1980, THESIS U ILLINOIS UR
[74]  
CHRISTOFIDES N, 1976, S ALGORITHMS COMPLEX
[75]   NEW APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY [J].
CLARKSON, KL .
DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) :195-222
[76]   APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY .2. [J].
CLARKSON, KL ;
SHOR, PW .
DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) :387-421
[77]   AN ALGORITHM FOR GEOMETRIC MINIMUM SPANNING-TREES REQUIRING NEARLY LINEAR EXPECTED TIME [J].
CLARKSON, KL .
ALGORITHMICA, 1989, 4 (04) :461-469
[78]  
CLARKSON KL, 1988, 4TH P ACM S COMP GEO, P12
[79]  
COLE R, 1990, LECT NOTES COMPUT SC, V443, P432
[80]   VORONOI REGIONS OF LATTICES, 2ND MOMENTS OF POLYTOPES, AND QUANTIZATION [J].
CONWAY, JH ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (02) :211-226