Recovering Circles and Spheres from Point Data

Methods for fitting circles and spheres to point sets are discussed. LADAR (LAser Detection And Ranging) scanners are capable of generating ‘point clouds’ containing the (x, y, z) coordinates of up to several millions of points reflecting the laser signals. In particular, coordinates collected off objects such as spheres may then be used to model these objects by fitting procedures. Fitting amounts to minimizing what is called here a “gauge function,” which quantifies the quality of a particular fit. This work analyzes and experimentally examines the impact of the choice of three such gauge functions. One of the resulting methods, termed here as “algebraic” fitting, formulates the minimization problem as a regression. The second, referred to as “geometric” fitting, minimizes the sum of squares of the Euclidean distances of the data points from the tentative sphere. This method, based on orthogonal distance minimization, is most highly regarded and widely used. The third method represents a novel way of fitting. It is based on the directions in which the individual data points have been acquired.

[1]  Zvi Drezner,et al.  On the circle closest to a set of points , 2002, Comput. Oper. Res..

[2]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Craig M. Shakarji,et al.  Least-Squares Fitting Algorithms of the NIST Algorithm Testing System , 1998, Journal of research of the National Institute of Standards and Technology.

[4]  David Gilman FINDING THE CENTER OF A CIRCULAR STARTING LINE IN AN ANCIENT GREEK STADIUM , 1997 .

[5]  Roland Glowinski,et al.  On the Simulation and Control of Some Friction Constrained Motions , 1995, SIAM J. Optim..

[6]  C. T. Kelley,et al.  An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima , 1995, SIAM J. Optim..

[7]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[8]  Saul I. Gass,et al.  Fitting Circles and Spheres to Coordinate Measuring Machine Data , 1998 .

[9]  Chris Rorres,et al.  Classroom Note: Finding the Center of a Circular Starting Line in an Ancient Greek Stadium , 1997, SIAM Rev..

[10]  W. Gander,et al.  Least-squares fitting of circles and ellipses , 1994 .

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  Javier Bernal AGGRES:: a program for computing power crusts of aggregates , 2006 .

[13]  Robert Michael Lewis,et al.  Pattern Search Algorithms for Bound Constrained Minimization , 1999, SIAM J. Optim..

[14]  Janet E. Rogers,et al.  Orthogonal Distance Regression ∗ , 2009 .

[15]  David Gilman Romano,et al.  Athletics and Mathematics in Archaic Corinth: The Origins of the Greek Stadion , 1993 .

[16]  A. C. Woo,et al.  On characterizing circularity Shou-Yan Chou, Tony C. Woo, Stephen M. Pollock. , 1992 .

[17]  C. Yap Exact computational geometry and tolerancing metrology , 1994 .

[18]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[19]  Robert B. Schnabel,et al.  Comparison of two sphere fitting methods , 1986 .

[20]  Jack Snoeyink,et al.  Fitting a Set of Points by a Circle , 1998, Discret. Comput. Geom..

[21]  Saul I. Gass Comments on an ancient Greek racecourse: finding minimum width annuluses , 2008, J. Glob. Optim..