Now showing items 1-4 of 4

    • An Algorithm for the Newton Resultant 

      Canny, John; Pedersen, Paul (Cornell University, 1993-10)
      Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, $$\eqlabel(\InputSystem) f_i(\x) \quad = \quad \sum_{q\in \A_i} c_{iq} \,x^q; \qquad q \,=\, (q_1,\ldots,q_n); \qquad \x^q \,=\, ...
    • On the Complexity of Kinodynamic Planning 

      Canny, John; Donald, Bruce Randall; Reif, John; Xavier, Patrick G. (Cornell University, 1988-08)
      In robotics, kinodynamic planning attempts to solve a motion problem subject to simultaneous kinematic and dynamic constraints. We consider the following problem: given a robot system, find a minimal-time trajectory from ...
    • A Rational Rotation Method for Robust Geometric Algorithms (Extended Abstract) 

      Canny, John; Donald, Bruce Randall; Ressler, Gene K. (Cornell University, 1991-12)
      Algorithms in computational geometry often use the real-RAM model of computation. In particular, this model assumes that exact real numbers can be stored in and retrieved from memory in constant $O$ (1) time, and that ...
    • Simplified Voronoi Diagrams 

      Canny, John; Donald, Bruce Randall (Cornell University, 1987-11)
      We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an $r$ dimensional space may be simplified to a search on an $r-1$ dimensional Voronoi diagram. We define a Voronoi ...