Unformatted text preview: sites. We deﬁne the Voronoi diagram of P as the subdivision of the plane into n cells, one for each site in P , with the property that a point q lies in the cell corresponding to a site p i if and only if dist( q, p i ) < dist( q, p j ) for each p j ∈ P with j ± = i . (See Fig. 1). The lower bound on time complexity for a sorting problem is Ω( n log n ), where n is the Figure 1: Voronoi diagram for a set of points P input size. Show that the lower bound of time complexity of computing Voronoi diagrams is Ω( n log n ) from the lower bound for the sorting problem. 1...
View Full Document
- Spring '08
- Algorithms, Computational complexity theory, lower bound, Voronoi diagram, Johann Peter Gustav Lejeune Dirichlet, Mathematical diagram