Now showing items 1-2 of 2

    • Addition Requirements for Rational Functions 

      Kirkpatrick, David G.; Kedem, Zvi M. (Cornell University, 1975-08)
      A notion of rank or independence for arbitrary sets of rational functions is developed, which bounds from below the number of additions and subtractions required of all straight-line algorithms which compute those ...
    • 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 ...