D. Yoon, J. Shen, P. Mohanty, and J. Kantz
[1] K.C. Fan, A non-contact automatic measurement for free-formsurface profiles, Computer Integrated Manufacturing Systems,10 (4), 1997, 277–285. doi:10.1016/S0951-5240(97)00020-7 [2] F. Xi & P. Shu, CAD-based path planning for 3-D line laserscanning, CAD, 31, 1999, 473–479. [3] P.J. Besl, A method for registration of 3-D shapes, IEEETrans. on Pattern Analysis and Machine Intelligence, 14 (2),1992, 239–256. doi:10.1109/34.121791 [4] T. Varady, R.R. Martin, & J. Cox, Reverse engineering ofgeometric models: An introduction, Computer-Aided Design,29 (4), 1997, 255–268. doi:10.1016/S0010-4485(96)00054-1 [5] P. Benko, R.R. Martin, & T. Varady, Algorithms for reverseengineering boundary representation models, Computer-AidedDesign, 33, 2001, 839–851. doi:10.1016/S0010-4485(01)00100-2 [6] E. Lengyel, Mathematics for 3-D game programming & com-puter graphics (Hungham, MA: Charles River Media, 2002). [7] D. Blackmore, M.C. Leu, L.P. Wang, & H. Jiang, Sweptvolume: A retrospective and perspective view, Neural, Parallel& Scientific Computations, 5, 1997, 81–102. [8] J.R. Rossignac & J.J. Kim, Computing and visualizing pose-interpolating 3-D motions, CAD, 33, 2001, 279–291. [9] L. Piegl & W. Tiller, The Nurbs book (New York: Springer,1997). [10] M.E. Mortenson, Geometric modelling, 2nd ed. (New York:John Wiley & Sons, 1997). [11] A. Paoluzzi, Geometric programming for computer-aided design(West Sussex, England: Wiley, 2003).283 [12] I.K. Lee, Curve reconstruction from unorganized points,Computer-Aided Geometric Design, 17, 2000, 161–177. doi:10.1016/S0167-8396(99)00044-8 [13] L. Piegl & W. Tiller, Algorithms for finding all k nearestneighbours, Computer Aided Design, 34, 2000, 167–172. doi:10.1016/S0010-4485(00)00141-X [14] J. Kantz, Application of sweeping techniques to reverse en-gineering, master’s thesis, University of Michigan–Dearborn,2003.
Important Links:
Go Back