The Rotating Calipers: An Efficient, Multipurpose, Computational Tool

A paper published in 1983 established that the rotating calipers paradigm provides an elegant, simple, and yet powerful computational tool for solving several geometric problems. In the present paper the history of this tool is reviewed, and stock is taken of the rich variety of computational two-dimensional problems and applications that have been tackled with it during the past thirty years.

[1]  Joseph O'Rourke,et al.  Finding minimal enclosing boxes , 1985, International Journal of Computer & Information Sciences.

[2]  C. Grima,et al.  Computational Geometry on Surfaces , 2001, Springer Netherlands.

[3]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[4]  Godfried T. Toussaint,et al.  A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets , 1982, Pattern Recognit. Lett..

[5]  Paul L. Rosin,et al.  Rectilinearity Measurements for Polygons , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[7]  Joseph S. B. Mitchell,et al.  Minimum-perimeter enclosures , 2008, Inf. Process. Lett..

[8]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[9]  David M. Mount,et al.  The Densest Double-Lattice Packing of a Convex Polygon , 1991, Discrete and Computational Geometry.

[10]  Godfried T. Toussaint,et al.  Fast algorithms for computing the diameter of a finite planar set , 2005, The Visual Computer.

[11]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[12]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[13]  Gill Barequet,et al.  Optimizing a Strip Separating Two Polygons , 1998, Graph. Model. Image Process..

[14]  Paul L. Rosin Measuring shape: ellipticity, rectangularity, and triangularity , 2003, Machine Vision and Applications.

[15]  Godfried T. Toussaint,et al.  On the multimodality of distances in convex polygons , 1982 .

[16]  Sergios Theodoridis,et al.  A geometric approach to Support Vector Machine (SVM) classification , 2006, IEEE Transactions on Neural Networks.

[17]  Godfried T. Toussaint,et al.  Quadrangulations of Planar Sets , 1995, WADS.

[18]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[19]  Paul L. Rosin,et al.  On the Orientability of Shapes , 2006, IEEE Transactions on Image Processing.

[20]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[21]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[22]  G. Toussaint Solving geometric problems with the rotating calipers , 1983 .

[23]  Godfried T. Toussaint,et al.  Optimal algorithms for computing the minimum distance between two finite planar sets , 1983, Pattern Recognit. Lett..

[24]  Ulf Grenander Pattern synthesis , 1976, Lectures in pattern theory / U. Grenander.

[25]  Michael E. Houle,et al.  Algorithms for Weak and Wide Separation of Sets , 1993, Discret. Appl. Math..

[26]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[27]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[28]  Ivan Stojmenovic,et al.  Computing shortest transversals of sets , 1992, Int. J. Comput. Geom. Appl..

[29]  Godfried T. Toussaint,et al.  Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.

[30]  J. Rasson,et al.  Geometrical tools in classification , 1996 .

[31]  Yoav Freund,et al.  Large Margin Classification Using the Perceptron Algorithm , 1998, COLT.

[32]  Sandip Das,et al.  Smallest k-point enclosing rectangle and square of arbitrary orientation , 2005, Inf. Process. Lett..

[33]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[34]  Godfried T. Toussaint,et al.  Complexity, convexity, and unimodality , 1984, International Journal of Computer & Information Sciences.

[35]  Frans C. A. Groen,et al.  The smallest box around a package , 1981, Pattern Recognit..

[36]  Joseph S. B. Mitchell,et al.  Spiral Serpentine Polygonization of a Planar Point Set , 2011, EGC.

[37]  Rabab Kreidieh Ward,et al.  On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane , 1987, Inf. Process. Lett..

[38]  Paul L. Rosin,et al.  A new convexity measure for polygons , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[39]  Prosenjit Bose,et al.  Some Aperture-Angle Optimization Problems , 2002, Algorithmica.

[40]  Godfried T. Toussaint,et al.  Computational geometry and facility location , 1990 .

[41]  Jovisa D. Zunic,et al.  Shape elongation from optimal encasing rectangles , 2010, Comput. Math. Appl..

[42]  Chia-Tche Chang,et al.  Fast oriented bounding box optimization on the rotation group SO(3,ℝ) , 2011, TOGS.

[43]  Godfried T. Toussaint,et al.  Linear Approximation of Simple Objects , 1992, Comput. Geom..

[44]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Computer Graphics and Image Processing.

[45]  Godfried T. Toussaint,et al.  NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICE , 1986 .

[46]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[47]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[48]  Godfried T. Toussaint,et al.  A simple linear algorithm for intersecting convex polygons , 1985, The Visual Computer.

[49]  Ali Shokoufandeh,et al.  Euclidean TSP between two nested convex obstacles , 2005, Inf. Process. Lett..