Randomized incremental construction of abstract Voronoi diagrams
暂无分享,去创建一个
Abstract Voronoi diagrams were introduced by R.~Klein as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time $O(n\log n)$ by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique. The new algorithm has the following advantages over previous algorithms: \begin{itemize} \item It can handle a much wider class of abstract Voronoi diagrams than the algorithms presented in [Kle89b, MMO91]. \item It can be adapted to a concrete kind of Voronoi diagram by providing a single basic operation, namely the construction of a Voronoi diagram of five sites. Moreover, all geometric decisions are confined to the basic operation, and using this operation, abstract Voronoi diagrams can be constructed in a purely combinatorial manner.
[1] Jean-Daniel Boissonnat,et al. On the Randomized Construction of the Delaunay Tree , 1993, Theor. Comput. Sci..
[2] Mariette Yvinec,et al. Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..
[3] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[4] Franz Aurenhammer,et al. Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..