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.
更多
查看译文
关键词
randomized insertion,convex hull,divide-and-conquer,geometric data structure,object modeling,cell complex,spanning tree,growth model,crystal structure,triangulation,higher dimensional embedding,proximity,motion planning,plane-sweep,combinatorial complexity,k-set,fundamental geometric data structure,neighbor searching,voronoi diagram,hyperplane arrangement,clustering,data structure,divide and conquer,computational geometry,object model