Now showing items 6-6 of 6

    • Sorting Helps for Voronoi Diagrams 

      Chew, L. Paul; Fortune, Steven (Cornell University, 1993-05)
      It is well known that, using standard models of computation, it requires $\Omega(n$ log $n$) time to build a Voronoi diagram for $n$ data points. This follows from the fact that a Voronoi diagram algorithm can be used ...