John Canny: Journal Publications

1
Eric Paulos and John Canny. Ubiquitous tele-embodiment: Applications and implications.
International Journal of Human-Computer Studies, 46(6):861-877, 1997.
Special Issue on Innovative Applications of the World Wide Web. Adobe PDF

2
A.S. Wallack and J.F. Canny. Object recognition and localization from scanning beam sensors.
International Journal of Robotics Research, 16(5):631-659, 1997.

3
A.S. Wallack and J.F. Canny. Generalized polyhedral object recognition and localization using crossbeam sensing.
International Journal of Robotics Research, 16(4):473-496, 1997.

4
A.S. Wallack and J.F. Canny. Planning for modular and hybrid fixtures.
Algorithmica, 19(1-2):40-60, 1997.

5
I.Z. Emiris, J.F. Canny, and R. Seidel. Efficient perturbations for handling geometric degeneracies.
Algorithmica, 19(1-2):219-242, 1997.

6
Philippe Moutarlier, Brian Mirtich, and John Canny. Shortest paths for a car-like robot to manifolds in configuration space.
International Journal of Robotics Research, 15(1):36-60, 1996.

7
Eric Paulos and John Canny. A world wide web telerobotic remote environment browser.
World Wide Web Journal, 1996.

8
I.Z. Emiris and J.F. Canny. A general approach to removing degeneracies.
SIAM J. Computing, 24(3):650-664, 1995.

9
I.Z. Emiris and J.F. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume.
Journal of Symbolic Computation, 20(2):117-149, 1995.

10
Brian Mirtich and John Canny. A skeleton-based planner for the two-axle car.
to appear in IEEE Transactions on Robotics and Automation.

11
John Canny and Ken Goldberg. A RISC approach to sensing and manipulation.
Journal of Robotic Systems, 12(6):351-382, 1995.

12
D. Manocha and J.F. Canny. Efficient inverse kinematics for general 6R manipulators.
IEEE Journal on Robotics and Automation, pages 648-657, 1994.

13
John Canny and Ken Goldberg. A RISC approach to robotics.
IEEE Robotics and Automation Magazine, 1(1):26-28, 1994.

14
Dinesh Manocha and John Canny. Multipolynomial resultant algorithms.
Journal of Symbolic Computation, 15(2):99-122, 1993.

15
John Canny. Improved algorithms for sign-determination and existential quantifier elimination.
Computer Journal, 36(5):409-418, 1993. Special Issue on Quantifier Elimination.

16
John Canny. Computing roadmaps of general semi-algebraic sets.
Computer Journal, 36(5):504-514, 1993. Special Issue on Quantifier Elimination.

17
J.F. Canny and M. Lin. An opportunistic global path planner.
Algorithmica, 10:102-120, 1993.

18
B. Donald, P. Xavier, J. Canny, and J. Reif. Kinodynamic motion planning.
Journal of the ACM, 40(5):1048-1066, 1993.

19
C. Bajaj, J. Canny, T. Garrity, and J. Warren. Factoring rational polynomials over the complexes.
SIAM Journal on Computing, 22(2):318-331, 1993.

20
D. Manocha and J.F. Canny. The implicit representation of rational parametric surfaces.
Journal of Symbolic Computation, 13:485-510, 1992.

21
D. Manocha and J.F. Canny. Algorithms for implicitizing rational parametric surfaces.
Journal of Computer-Aided Geometric Design, 9:25-50, 1992.

22
J.F. Canny, D.Y. Grigor'ev, and N.N. Vorobjov. Finding connected components of a semialgebraic set in subexponential time.
App. Algebra in Eng. Comm. and Comp., 2:217-238, 1992.

23
D. Manocha and J.F. Canny. Detecting cusps and inflection points in curves.
Computer Aided Geometric Design, 9:1-24, 1992.

24
Z. Gigus, J.F. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects.
IEEE Trans. Pattern Analysis and Machine Intelligence, 13(6):542-551, 1991.

25
J. Canny, A. Rege, and J. Reif. An exact algorithm for kinodynamic planning in the plane.
Discrete and Computational Geometry, pages 461-484, 1991.

26
D. Manocha and J.F. Canny. A new approach for surface intersection.
International Journal of Computational Geometry and Applications, 1(4):491-516, 1991.
Special issue on Solid Modeling.

27
D. Manocha and J.F. Canny. Rational curves with polynomial parametrization.
Computer Aided Design, 23(9):645-652, 1991.

28
Z. Li and J. Canny. Motion of two rigid bodies with rolling constraint.
IEEE Journal on Robotics and Automation, 6(1):62-72, 1990.

29
J.F. Canny. Generalized characteristic polynomials.
Journal of Symbolic Computation, 9(3), 1990.

30
J. F. Canny and B. R. Donald. Simplified voronoi diagrams.
Discrete and Computational Geometry, 3:219-236, 1988.

31
J.F. Canny. Constructing roadmaps of semi-algebraic sets I: Completeness.
Artificial Intelligence, 37:203-222, 1988.

32
J. F. Canny. Collision detection for moving polyhedra.
IEEE Trans. Pattern Analysis and Machine Intelligence, pages 200-209, 1986.

33
J. F. Canny. A computational approach to edge detection.
IEEE Trans. Pattern Analysis and Machine Intelligence, pages 679-698, 1986.


Conference Publications

 

  1. Alastair Iles, Daniel Glaser, Matthew Kam, and John Canny. Distributed learning: Livenotes and 
    handheld wireless technology. In
    Computer-Supported Collaborative Learning (CSCL), Jan 2002.
  2. Joanie Connell, Jerry Mendelsohn, Rick Robins, and John Canny. Donít hang up on the phone,
    yet! In
    ACM GROUP (Conf. on Group support), Sept 2001.
  3. D. Reznik, J. Canny, and N. Alldrin. Leaving on a plane jet. In 2001 Int. Conf. on Intelligent 
    Robots & Systems (IROS
    ), Maui, Hawaii, October 2001.
  4. Francesca Barrientos and John Canny. Cursive, a novel interaction technique for controlling
    expressive avatar gesture. In
    ACM UIST, 2001. short paper.
  5. D. Reznik and J. Canny. Címon part, do the local motion! In 2001 IEEE Int. Conf. on Robotics
    & Autom. (ICRA
    ), Seoul, Korea, May 2001.
  6. Paulos and John Canny. Personal tele-embodiment. In Roland Siegwart and Ken Goldberg, 
    editors, Robots
    on the Web: Physical Interaction through the Internet. MIT Press, 2001.
  7. John Canny and Eric Paulos. Tele-embodiment and shattered presence: Reconstructing the
    body for online interaction. In Ken Goldberg, editor,
    The Robot in the Garden: Telerobotics
    and Telepistemology on the Interne
    t. MIT Press, March 2000.
  8. D. Reznik, E. Moshkovich, and J. Canny. Building a universal part manipulator. In Workshop
    in Distributed Manipulation, IEEE Int. Conf. on Rob. & Autom. (ICRA
    ), Detroit, MI, May 1999.
  9. D. Reznik, E. Moshkovich, and J. Canny. Building a universal part manipulator. In
    K. Bohringer and H. Choset, editors,
    Distributed Manipulation. Kluwer Academic Press, 1999.
  10. Yan Zhuang and John Canny. Real-time simulation of physically realistic global deformation.
    In
    IEEE Visualization Conf., San Francisco, 1999.
  11. Yan Zhuang and John Canny. Real-time and physically realistic simulation of global deformation.
    In
    ACM SIGGRAPH, 1999. Technical Sketch.
  12. Eric Paulos and John Canny. Designing personal tele-embodiment.
    In IEEE Conference on Robotics and Automation, 1998.
  13. Eric Paulos and John Canny. Prop: Personal roving presence. ACM SIGCHI, 1998. Los Angeles.
  14. D. Reznik and J. Canny. A flat rigid plate is a universal planar manipulator.
    In IEEE Conference on Robotics and Automation, 1998. Leuven, Belgium, April 
    (Anton Phillips best student paper award nomination).
  15. D. Reznik and J. Canny. The coulomb pump: A novel parts feeding method using a horizontally-vibrating surface.
    In IEEE Conference on Robotics and Automation, 1998. Leuven, Belgium, April.
  16. D. Reznik and J. Canny. Universal part manipulation in the plane with a single horizontally-vibrating plate.
    In Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998. Houston, TX.
  17. D. Reznik, S. Brown, and J. Canny. Dynamic simulation as a design tool for a microactuator array.
    In IEEE Conf. on Robotics and Automation (ICRA), 1997. Albuquerque, NM.
  18. D. Reznik, J. Canny, and K. Goldberg. Analysis of part motion on a longitudinally vibrating plate.
    In Int. Conf. on Intell. Robots and Systems (IROS), 1997. Grenoble, France.
  19. D. Reznik and J. Canny. Dynamics of part motion on a longitudinally vibrating parts feeder.
    In IEEE Int. Symp. on Assembly and Task Planning (ISATP), 1997. Marina del Rey, CA, August.
  20. Dina R. Berkowitz and John Canny. A comparison of real and simulated designs for vibratory parts feeding.
    In Proceedings of the IEEE Conference on Robotics and Automation, pages 2377-2382, 1997.
  21. A. Wallack and J. Canny. Complete indexing strategies for sparse sensing techniques.
    In Proceedings, International Symposium on Assembly and Task Planning, 1996.
  22. A. Wallack and J. Canny. Modular fixture design for generalized polyhedra.
    In IEEE Conference on Robotics and Automation, 1996. 
    (Nominated for Anton Phillips Best Student Paper Award).
  23. Eric Paulos and John Canny. Fast construction of near optimal probing strategies.
    In Workshop on Algorithmic Foundation of Robotics, 1996.
  24. Eric Paulos and John Canny. Delivering real reality to the world wide web via telerobotics.
    In IEEE Conference on Robotics and Automation, 1996.
  25. Brian Mirtich, Yan Zhuang, Ken Goldberg, John Craig, Rob Zanutta, Brian Carlisle, and John Canny. 
    Estimating pose statistics for robotic part feeders. In IEEE International Conference on Robotics 
    and Automation.
    , May 1996. Minneapolis.
  26. Dina Berkowitz and John Canny. Designing part feeders with dynamic simulation.
    In IEEE Conference on Robotics and Automation, pages 1127-1132. IEEE, 1996.
  27. A. Wallack and J. Canny. Object recognition and localization from scanning beam sensors.
    In IEEE Conference on Robotics and Automation, 1995. Nagoya, Japan, 
    (Nominated for Anton Phillips Best Student Paper Award).
  28. Brian Mirtich and John Canny. Impulse-based simulation of rigid bodies.
    In Symp. on Interactive 3D Graphics, 1995. Monterrey, CA.
  29. Aaron Wallack and John Canny. Efficient indexing techniques for model based sensing.
    In International Conference on Computer Vision and Pattern Recognition, pages 259-266. IEEE, june 1994.
  30. A. Wallack and J. Canny. Planning for modular and hybrid fixtures.
    In IEEE Conference on Robotics and Automation, pages 520-527, 1994.
  31. B. Mirtich and J. Canny. Easily computable optimum grasps in 2-D and 3-D.
    In IEEE Conference on Robotics and Automation, pages 739-747, 1994.
  32. David Parsons and John Canny. Geometric problems in molecular biology and robotics.
    In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology
    Stanford, CA, August 1994.
  33. E. Rimon and J. Canny. Construction of c-space roadmaps from local sensory data: What should the sensors look for?
    In IEEE Conference on Robotics and Automation, pages 117-123, 1994. San Diego.
  34. M.C. Lin, D. Manocha, and J. Canny. Fast contact determination in dynamic environments.
    In IEEE Conference on Robotics and Automation, pages 602-609, 1994.
  35. Eric Paulos and John Canny. Accurate insertion strategies using simple optical sensors.
    In IEEE Conference on Robotics and Automation, pages 1656-1662, 1994.
  36. John Canny and Ken Goldberg. RISC robotics: Recent results and open problems.
    In IEEE Conference on Robotics and Automation, pages 1951-1958, San Diego CA., 1994.
  37. A. Wallack, J. Canny, and D. Manocha. Object localization using crossbeam sensing.
    In IEEE Conference on Robotics and Automation, pages 692-699, 1993.
  38. A. Wallack and J. Canny. A geometric matching algorithm for beam scanning.
    In SPIE Symposium on Vision Geometry II, pages 143-159, 1993. Boston, Massachusetts.
  39. John Canny and Ioannis. Emiris. An efficient algorithm for the sparse mixed resultant.
    In G. Cohen, T. Mora, and O. Moreno, editors, Proc. 10th Intern. Symp. on Applied Algebra, 
    Algebraic Algorithms and Error-Correcting Codes
    , pages 89-104. Springer Verlag, May 1993. 
    Lect. Notes in Comp. Science 263.
  40. Ioannis Emiris and John Canny. A practical method for the sparse resultant.
    In M. Bronstein, editor, Proc. of ACM Int. Symp. Symbolic Algebr. Computation
    pages 183-192, Kiev, July 1993.
  41. Eric Paulos and John Canny. Informed peg-in-hole insertion using optical sensors.
    In SPIE Conference on Sensor Fusion VI, 1993. Boston Massachusetts.
  42. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies.
    In ACM Symposium on Computational Geometry, pages 74-82, 1992.
  43. D. Manocha and J.F. Canny. Real time inverse kinematics of general 6R manipulators.
    In IEEE Conference on Robotics and Automation, pages 383-389, 1992.
  44. B. Mirtich and J. Canny. Using skeletons for nonholonomic path planning among obstacles.
    In IEEE Conference on Robotics and Automation, pages 2533-2540, 1992.
  45. M. Lin and J. Canny. Efficient collision detection for animation. In Third Eurographics Workshop, 1992.
  46. John Canny, Bruce Donald, and Gene Ressler. A rational rotation method for robust geometric algorithms.
    In ACM Symposium on Computational Geometry, pages 251-260, 1992.
  47. M. Lin and J. Canny. A fast algorithm for incremental distance calculation.
    In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
  48. J.F. Canny and J.M. Rojas. An optimal condition for determining the exact number of roots of a polynomial system.
    In International Symposium on Symbolic and Algebraic Computation, 1991. Bonn, Germany.
  49. Dinesh Manocha and John Canny. Multipolynomial resultant algorithms. In Int. 
    Symp. on Intelligent Robotics
    , 1991. Bangalore, India.
  50. Dinesh Manocha and John Canny. Efficient techniques for multipolynomial resultant algorithms.
    In ISSAC-91, 1991. Bonn, Germany.
  51. J.F. Canny. An improved sign determination algorithm. In AAECC-91, 1991. New Orleans.
  52. J.F. Canny. Computing roadmaps of general semi-algebraic sets. In AAECC-91, 1991. New Orleans.
  53. I. Emiris and J. Canny. A general approach to removing degeneracies.
    In IEEE Conference on Foundations of Computer Science, pages 405-413, 1991.
  54. J.F. Canny and M. Lin. An opportunistic global path planner. In IEEE Conference on 
    Robotics and Automation
    , pages 1554-1561, 1990.
  55. G. Heinzinger, P. Jacobs, J. Canny, and B. Paden. Time-optimal trajectories for a robot manipulator: 
    A provably good approximation algorithm. In Automatic Control Conference, 1990.
  56. P. Jacobs, G. Heinzinger, J. Canny, and B. Paden. Time-optimal trajectories for a robot manipulator: 
    A provably good approximation algorithm. In IEEE Conference on Robotics and Automation, pages 150-156, 1990.
  57. P. Jacobs and J. Canny. Robust motion planning for mobile robots. In IEEE Conference on 
    Robotics and Automation
    , pages 2-7, 1990.
  58. D. Manocha and J. Canny. Polynomial parametrizations for rational curves.
    In SPIE Conf. on Curves and Surface in Computer Vision and Graphics, pages 151-162, 1990. Santa Clara, Ca.
  59. D. Manocha and J. Canny. Implicitizing rational parametric surfaces. In Conference on Algebraic 
    Algorithms and Error-Correcting Codes
    , 1990. Tokyo.
  60. D. Manocha and J. Canny. Detecting cusps and inflection points on curves.
    In International Symposium on Symbolic and Algebraic Computation, 1990. Tokyo.
  61. D. Parsons and J. Canny. Motion planning for multiple mobile robots. In IEEE Conference on 
    Robotics and Automation
    , pages 8-13, 1990.
  62. A. Rege, J. Canny, and J. Reif. An exact algorithm for kinodynamic planning in the plane. In 
    ACM Symposium on Computational Geometry
    , pages 271-280, 1990.
  63. D. Manocha and J. Canny. Algorithms for implicitizating rational parametric surfaces. 
    In Fourth IMA Conf. on the Mathematics of Surface, 1990. Bath, England.
  64. J. Canny. On computability of fine motion plans. In IEEE Conference on Robotics and 
    Automation
    , pages 177-183, 1989.
  65. P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In IEEE Conference on 
    Robotics and Automation
    , pages 2-7, 1989.
  66. Z. Li, J. Canny, and S. Sastry. On motion planning for dextrous manipulation, part I: The problem formulation. 
    In IEEE Conference on Robotics and Automation, pages 775-780, 1989.
  67. C. Bajaj, J. Canny, T. Garrity, and J. Warren. Factoring rational polynomials over the complexes. 
    In International Symposium on Symbolic and Algebraic Computation, pages 81-90, 1989.
  68. J. Canny, E. Kaltofen, and L. Yagati. Solving systems of non-linear polynomial equations faster. In International 
    Symposium on Symbolic and Algebraic Computation
    , pages 121-128, 1989.
  69. Z. Li, J. Canny, and G. Heinzinger. Robot motion planning with nonholonomic constraints. In International 
    Symposium on Robotics Research
    , pages 343-350, 1989.
  70. J.F. Canny. Some algebraic and geometric computations in PSPACE. In ACM Symposium on 
    Theory of Computing
    , pages 460-467, 1988.
  71. Z. Gigus, J.F. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. 
    In Proc. 2nd Int. Conf. on Computer Vision, New York, pages 654-661, 1988.
  72. J.F. Canny. Generalized characteristic polynomials. In International Symposium on 
    Symbolic and Algebraic Computation
    , 1988.
  73. J. Canny, B. Donald, J. Reif, and P. Xavier. On the complexity of kinodynamic planning. In IEEE Conference on 
    Foundations of Computer Science
    , pages 306-318, 1988.
  74. J. Canny and B. Donald. Simplified voronoi diagrams. In ACM Symposium on Computational Geometry, 1987.
  75. J. Canny. A new algebraic method for robot motion planning and real geometry. In IEEE Conference on 
    Foundations of Computer Science
    , 1987.
  76. J. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In IEEE Conference 
    on Foundations of Computer Science
    , pages 39-48, 1987.
  77. J. Canny. A voronoi method for the piano movers' problem. In IEEE Conference on Robotics and 
    Automation
    , 1985.
  78. J. Canny. On finding collisions between polyhedra. In Proc. ECAI-84 (European Conf. on Artificial Intelligence), 1984.
  79. J. Canny. A variational approach to edge detection. In AAAI-83, 1983.




John Canny
Sun March 3, 2002