Immobilizing a polytope

  • Jurek Czyzowicz
  • Ivan Stojmenovic
  • Jorge Urrutia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)


We say that a polygon P is immobilized by a set of points I on its boundary if any rigid motion of P in the plane causes at least one point of I to penetrate the interior of P. Three immobilization points are always sufficient for a polygon with vertices in general positions, but four points are necessary for some polygons with parallel edges. An O(n log n) algorithm that finds a set of 3 points that immobilize a given polygon with vertices in general positions is suggested. The algorithm becomes linear for convex polygons. Some results are generalized for d-dimensional polytopes, where 2d points are always sufficient and sometimes necessary to immobilize. When the polytope has vertices in general position d+1 points are sufficient to immobilize.


Interior Point General Position Voronoi Diagram Convex Polygon Rigid Motion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AGSS]
    A. Aggarwal, L.J. Guibas, J. Saxe, and P.W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discr. Comput. Geom., 4, 591–604, 1989.Google Scholar
  2. [BFG]
    B. S. Baker, S. Fortune, E. Grosse, Stable Prehension with Three Fingers, Proc. 17th Symp. on Theory of Computing, 1985, pp. 114–120.Google Scholar
  3. [CSU]
    J. Czyzowicz, I. Stojmenovic, J. Urrutia, Immobilizing a shape, Rapport de recherche RR 90/11-18, Dept. Informatique, Université du Québec à Hull, November 1990 (earlier version available as Technical Report TR-90-37, Dept. of Computer Science, Univ. of Ottawa, July 1990).Google Scholar
  4. [E]
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.Google Scholar
  5. [F]
    S. Fortune, A sweep-line algorithm for Voronoi diagrams, Proc. 2nd ACM Symp. on Computational Geometry, 1986, 313–322.Google Scholar
  6. [Ki]
    D.G. Kirkpatrick, Efficient computation of continuous skeletons, Proc. 20th IEEE Symp. on Found. of Comp. Sci., 1979, 18–27.Google Scholar
  7. [K]
    W. Kuperberg, DIMACS Workshop on Polytopes, Rutgers University, Jan. 1990.Google Scholar
  8. [MP]
    X. Markenscoff and Ch. H. Papadimitriou, Optimal grip of a polygon, Int. J. Robotics Research, 8, 2, 1989, 17–29.Google Scholar
  9. [MNP]
    X. Markenscoff, L. Ni and Ch. H. Papadimitriou, The Geometry of Grasping, Int. J. Robotics Research, 9, 1, 1990, 61–74.Google Scholar
  10. [MSS]
    B. Mishra, J.T. Schwartz and M. Sharir, On the Existence and Synthesis of Multifinger Positive Grips, Algorithmica (1987) 2: 541–548.Google Scholar
  11. [MS]
    B. Mishra and N. Silver, Some Discussions of Static Gripping and Its Stability, IEEE Transactions on Systems, Man and Cybernetics, 19, 4, July/August, 1989, pp. 783–796.Google Scholar
  12. [O]
    J. O'Rourke, Computational geometry column 9, SIGACT News, 21, 1, 1990, 18–20, Winter 1990, #74.Google Scholar
  13. [Y]
    C.K. Yap, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Discr. and Comput. Geom., 2, 1987, 365–393.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jurek Czyzowicz
    • 1
  • Ivan Stojmenovic
    • 2
  • Jorge Urrutia
    • 2
  1. 1.Departement d'InformatiqueUniversité du Québec à HullHullCanada
  2. 2.Computer Science DepartmentUniversity of OttawaOttawaCanada

Personalised recommendations