New Method for Free-Form Surface Fitting in Precision Metrology
2012
Abstract
To assess if a given manufactured artifact conform to a template CAD model, the artifact is measured by a coordinate measuring system to obtain a point cloud. The point cloud is compared to the CAD model by fitting the point cloud to the CAD model. One of approaches is based on a method required to determine footpoint parameters. The footpoints are the projection of the points in the point cloud onto the CAD surface. In this paper we introduce a new efficient method for estimating footpoint parameters.
References (15)
- REFERENCES
- A.B. Forbes, H.D. Minh., Form assessment in coordinate metrology, Approximation Algorithms for Complex Systems, 2009.
- L. Piegl and W. Tiller. The NURBS Book, 2 nd ed., 1997.
- A. B. Forbes. Structured nonlinear Gauss-Markov problems. In A. Iske and J. Levesley, editors, Algorithms for Approximation V, pages 167-186, Berlin, Springer, 2006.
- The initial graphics exchange specification (IGES) version 5.x, 2006.
- M.G. Cox, The least-squares solution of linear equations with blockangular observation matrix, Advances in Reliable Numerical Computation, (1989) 227-240.
- A.B. Forbes, Least squares best fit geometry elements, Algorithms for Approximation II, (1990) 311-319.
- J.L. Bentley, Multidimensional divide-and-conquer, Commun. ACM, 23 (1980) 15.
- J.L. Bentley, M.I. Shamos, Divide-and-conquer in multidimensional space, in: 8th Annu. ACM Sympos. Theory Comput., 1976, pp. 220-230.
- M.T. Dickerson, R.L. Drysdale, J.R. Sack., Simple algorithms for enumerating interpoint distances and finding k nearest neighbors., Internat. J. Comput. Geom. Appl., 2 (1992) 221-239.
- I.S. Ernst P. Mucke, and Binhai Zhu, Fast randomized point location without preprocessing in two-and three-dimensional delaunay triangulations, in: Proceedings of the twelfth annual symposium on Computational geometry, SCG '96,, ACM, New York, NY, USA, 1996, pp. 274-283.
- D. Attali, J.-D. Boissonnat, A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces, in: SMA '02 Proceedings of the seventh ACM symposium on Solid modeling and applications, 2002.
- M.T. Dickerson, R.L. Drysdale., Enumerating k distances for n points in the plane, in: Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 234-238.
- M.T. Dickerson, R.S. Drysdale., Fixed-radius near neighbor search algorithms for points and segments, Inform. Process. Lett., 35 (1990) 269-273.
- P.M. Vaidya, An O(n log n) algorithm for the all-nearest- neighbors problem, Discrete Comput. Geom., 4 (1989) 101-115.