Summary
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G.T. Anthony, B. Bittner, B.P. Butler, M.G. Cox, R. Drieschner, R. Elligsen, A.B. Forbes, H. Gross, S.A. Hannaby, P.M. Harris, and J. Kok. Chebychev reference software for the evaluation of coordinate measuring machine data. Report EUR 15304 EN, National Physical Laboratory, Teddington, United Kindom, 1993.
J. Bernal. AGGRES: a program for computing power crusts of aggregates. NIS-TIR 7306, National Institute Of Standards and Technology, Gaithersburg, MD, 2006.
P.J. Besl and N.D. McKay. A method for registration of 3-D shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14:239–256, 1992.
P.T. Boggs and J.E. Rogers. Orthogonal distance regression. Contempory Math, 112:183–194, 1990.
S-Y. Chou, T.C. Woo, and S.M. Pollock. On characterizing circularity. Dept. of Industrial and Operations Research, University of Michigan, Ann Arbor, 1994.
Z. Drezner, S. Steiner, and O. Weselowski. On the circle closest to a set of points. Computers and Operations Research, 29:637–650, 2002.
W. Gander, G.H. Golub, and R. Strebel. Least-squares fitting of circles and ellipses. BIT, 34:558–578, 1994.
J. Garcia-Lopez, P. A. Ramos, and J. Snoeyink. Fitting a set of points by a circle. Discrete and Computational Geometry, 20:389–402, 1998.
S.I. Gass, C. Witzgall, and H.H. Harary. Fitting circles and spheres to coordinate measuring machine data. International Journal of Flexible Manufacturing Systems, 10:5–25, 1998.
S.I. Gass. Comments on an ancient Greek racecourse: Finding minimum width annuluses. (unpublished manuscript), 1998.
P. Gilmore and C.T. Kelley. An implicit filtering algorithm for optimization of functions with many local minima. SIAM Journal on Optimization, 5:269–285, 1995.
D.E. Gilsinn, C. Witzgall, G.S. Cheok, and A. Lytle. Construction object identification from LADAR scans: an experimental study using I-beams. NISTIR 7286, National Institute of Standards and Technology, Gaithersburg, MD, 2005.
R. Glowinski and A.J. Kearsley. On the simulation and control of some friction constrained motions. SIAM Journal on Optimization, 5:681–694, 1995.
E. Golub and C.F. Van Loan. Matrix Computation. The Johns Hopkins University Press, Baltimore, MD, 1996.
R. M. Lewis and V. Torczon. Pattern search algorithms for bound constrained minimization. SIAM Journal on Optimization, 9:1082–1099, 1999.
B.A. Jones and R.B. Schnabel. A comparison of two sphere fitting methods. Proceedings of the Instrumentation and Measurement Technology Subgroup of the IEEE, 1986.
S.D. Phillips, B. Borchardt, and G.C. Gaskey. Measurement uncertainty consideration for coordinate measuring machines. NISTIR 5170, National Institute of Standards and Technology, Gaithersburg, MD, 1993.
D.G. Romano. Athletes and mathematics in archaic Corinth: the origins of the Greek stadium. Memoirs of the American Philosophical Society, 206:xiv,117, 1993.
C. Rorres and D.G. Romano. Finding the center of a circular starting line in an ancient Greek stadium. SIAM Review, 39:745–754, 1997.
C.M. Shakarji. Least-squares fitting algorithms of the NIST algorithmic testing system. Journal of Research of the National Institute of Standards and Technology, 103:633–640, 1998.
P.H. Schoenemann. A generalized solution of the orthogonal Procrustes problem. Psychometrica, 31:1–10, 1966.
C.K. Yap. Exact computational geometry and tolerancing metrology. Snapshots on Computational and Discrete Geometry, D. Avis and P. Bose, eds., McGill School of Computer Science, 3:34–48, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Witzgall, C., Cheok, G.S., Kearsley, A.J. (2006). Recovering Circles and Spheres from Point Data. In: Alt, F.B., Fu, M.C., Golden, B.L. (eds) Perspectives in Operations Research. Operations Research/Computer Science Interfaces Series, vol 36. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39934-8_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-39934-8_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-39933-1
Online ISBN: 978-0-387-39934-8
eBook Packages: Business and EconomicsBusiness and Management (R0)