Dynamic Voronoi Diagrams

Computational Geometry - An Introduction Through Randomized Algorithms; Mulmuley; 1994; pp 135-

Proposition 4.2.2: The total cost of maintaining a Voronoi diagram in a given update sequence is proportional to the total structural change during that sequence. This ignores a logarithmic factor in the cost of a deletion. It also ignores the cost of locating a conflicting vertex during addition. The expected (total) structural change during a random \((N,\delta)\) -sequence is \(O(n)\) .

 

 

Leave a Comment

Filed under Algorithms, Voronoi Diagrams

Leave a Reply

Your email address will not be published. Required fields are marked *