Now showing items 3-4 of 4

    • The Ultimate Planar Convex Hull Algorithm ? 

      Kirkpatrick, David G.; Seidel, Raimund (Cornell University, 1983-10)
      We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input set and $H$ is the size of the output set, i.e. the number of vertices found to be on the ...
    • Voronoi Diagrams and Arrangements 

      Edelsbrunner, Herbert; Seidel, Raimund (Cornell University, 1985-03)
      We propose a uniform and general framework for defining and dealing with Voronoi Diagrams. In this framework a Voronoi Diagram is a partition of a domain $D$ induced by a finite number of real valued functions on $D$. ...