參考文獻 |
[1] 蔡耀震,「逆向工程之曲面連續性理論與曲面模型自動化重建技術發展」,國立中央大學,博士論文,民國97年。
[2] 陳國仁,「最佳化嵌合理論於逆向工程與座標量測之研究」,國立中央大學,博士論文,民國96年。
[3] 許智超,「逆向工程與快速原型整合系統之研究」,國立台灣大學,碩士論文,民國88年。
[4] D. T. Pham and R. S. Gault, “A comparison of rapid prototyping technologies”, International Journal of Machine Tools & Manufacture, Vol. 38, pp. 1257-1287, 1998.
[5] 陳譽文,「五軸CNC曲面加工原理之研究」,國立中正大學,碩士論文,民國88年。
[6] 莊宗憲,「STL曲面加工之CNC刀具路徑規劃」,國立中正大學,碩士論文,民國90年。
[7] 莊振明,「STL模型之刀具路徑演算法與其應用」,國立中正大學,博士論文,民國92年。
[8] 蔡耀震,黃仲儀,林冠元,賴景義,翁文德,「逆向工程之連續性曲面模型自動化建構」,先進工程學刊,第三卷,第三期,209-215頁,民國97年7月。
[9] S. Melax, “A simple, fast, and effective polygon reduction algorithm”, Game Developer, November, pp. 44-49, 1998.
[10] M. Botsch, S. Steinberg, S. Bischoff, L. Kobbelt, “OpenMesh - a generic and efficient polygon mesh data structure” Computer Graphics and Multimedia RwTH Aachen, OpenSG Symposium, 2002.
[11] A. Gueziec and G. Taubin, “Cutting and stitching: Converting sets of polygons to manifold surfaces”, IEEE Trans. On Visualization and Computer Graphics, Vol. 7, No. 2, pp. 136-151, 2001.
[12] G. Barequet and M. Sharir, “Filling gaps in the boundary of a polyhedron”, Computer Aided Geometric Design, Vol. 12, pp. 207-229, 1995.
[13] G. Barequet and S. Kumar, “Repairing CAD models”, Proceedings of the 8th Conference on Visualization, pp. 363-370, October 1997.
[14] G. Barequet, “Using geometric hashing to repair CAD objects”, IEEE Computational Science and Engineering, October-December, pp. 22-28, 1997.
[15] M. Botsch and L.P. Kobbelt, “A robust procedure to eliminate degenerate facets from triangle meshes”, Proceedings of the Vision Modeling and Visualization Conference , pp. 283-290, November 2001.
[16] A. Petik “Some aspects of using STL file format in CAE systems”, International Workshop CA Systems and Technologies, pp. 80-86, 2000.
[17] I. Stroud and P. C. Xirouchakis, “STL and extensions”, Advances in Engineering Software, Vol. 31, No. 2, pp. 83-95, 2000.
[18] K. F. Leong, C. K. Chua and Y. M. Ng, “A study of StereoLithography file errors and repair, Part I: Generic solutions”, International Journal of Advanced Manufacturing Technology, Vol. 12, pp. 407-414, 1996.
[19] K. F. Leong, C. K. Chua and Y. M. Ng, “A study of StereoLithography file errors and repair, Part II: Special cases”, International Journal of Advanced Manufacturing Technology, Vol. 12, pp. 415-422, 1996.
[20] J. Wang and O. Manuel “A hole filling strategy for reconstruction of smooth surfaces in range images”, XVI Brazilian Symposium on Computer Graphics and Image Processing, pp. 12-15, Sao Carlos, October 2003.
[21] 許聖函,「三角網格資料定位整合與平滑性補洞之研究」,國立中央大學,碩士論文,民國93年。
[22] J. Davis, S. R. Marschner, M. Garr, M. Levoy , “Filling holes in complex surface using volumetric diffusion”, First International Symposium on 3D Data Processing, Visualization, and Transmission, pp. 19-21, Padova, Italy, June 2002.
[23] Y. Jun, “A piecewise hole filling algorithm in reverse engineering”, Computer-Aided Design, Vol. 37, No. 2, pp. 263-270, 2005.
[24] J. H. Bohn, “Removing zero-volume parts from CAD models for layered manufacturing”, IEEE Computer Graphics and Applications, pp. 27-34, November 1995
[25] P. Liepa, “Filling holes in meshes”, Eurographics Symposium on Geometry Processing, pp. 200-205, 2003.
[26] F. Bianconi, “Bridging the gap between CAD and CAE using STL files”, International Journal of CAD/CAM, Vol. 2, No. 1, pp. 55-67, 2002.
[27] P. Borodin, M. Novotni and R. Klein, “Progressive gap closing for mesh repairing”, Advances in Modeling, Animation and Rendering, Proceedings of Computer Graphics International, pp. 201-213, July 2002.
[28] C. Loop, “Managing adjacency in triangular meshes”, Technical Report, MSR-TR-2000-24, Microsoft Research, January 2000.
[29] S. J. Rock and M. J. Wozny, “Generating topological information from a “bucket of facets” ”, Solid Freeform Fabrication Proceedings, pp. 251-259, 1992.
[30] T.Fan,G. Medioni and R.Nevatia, “Segmented description of 3-D surface”, IEEE Transactions on Robotics and Automation, Vol. 3, No. 6, pp. 527-538, 1987.
[31] Y.H.Chen and C.Y.Liu, “Robust segmentation of CMM data based on NURBS”, The Intemational Joumal of Advanced Manufacturing Technology, Vol. 13, pp. 530-534, 1997.
[32] M.Yang and E. Lee, “Segmentation of measured point data using a parametric quadric surface approximation”, Computer-Aided Design, Vol. 31, pp. 449-457, 1999.
[33] H. Woo, E. Kang, S. Wang, K. H. Lee, “A new segmentation method for point cloud data”, International Journal of Machine tools and Manufacture, Vol. 42, pp. 167-178, 2002.
[34] J. A. Thorpe, Elementary topics in differential geometry, Springer, Berlin, 1978.
[35] G. Taubin, “Estimating the tensor of curvature of a surface from a polyhedral approximation”, Proceedings of the 5th International Conference on Computer Vision, pp. 902-907, 1995.
[36] T. Surazhsky, E. Magid, O. Soldea, G. Elber and E. Rivlin, “A comparison of Gaussian and mean curvatures estimation methods on triangular meshes”, International Conference on Robotics and Automation, pp. 1021-1026, Taipei, Taiwan, September 2003.
[37] E. Magid, O. Soldea and E. Rivlin, “A comparison of Gaussian and mean curvature estimation methods on triangular meshes of range image data”, Computer Vision and Image Understanding, Vol. 107, pp. 139-159, 2007.
[38] P. Krsek, G. Lukacs and R. R. Martin, “Algorithms for computing curvatures from range data”, The Mathematics of Surfaces VIII, Information Geometers, pp. 1-16, 1998.
[39] D. L. Page and A. F. Koschan and M. A. Abidi, ”Perception-based 3D triangle mesh segmentation using fast marching watersheds”, Proceedings of International Conference on Computer Vision and Pattern Recognition, Vol. 2, pp. 27-32, June 2003.
[40] J. Huang and C. H. Menq, “Automatic data segmentation for geometric feature extraction from unorganized 3D coordinate points”, IEEE Transactions on Robotics and Automation, Vol. 17, No. 3, pp. 268-79, June 2001.
[41] P. J. Besl and R. C. Jain, “Segmentation through variable-order surface fitting”, IEEE Transactions on Patten Analysis and Machine Intelligence, Vol. 10, No. 2, pp. 167-192, 1988.
[42] J. Y. Lai and T. C. Tsai, “A data segmentation technique for triangular meshes in reverse engineering”, Journal of the Chinese Society of Mechanical Engineers, Vol. 28, No. 3, pp. 289-300, 2007.
[43] G. Lavoue, F. Dupont and A. Baskurt, “Curvature tensor-based triangle mesh segmentation with boundary rectification”, Proceedings of Computer Graphics International Conference, pp. 10-25, 2004.
[44] H. C. Kim, S. M. Hur and S. H. Lee, “Segmentation of the measured point data in reverse engineering”, International Journal of Advanced Manufacturing Technology, Vol. 20, pp. 571-580, 2002.
[45] M. Vanco, “A direct approach for the segmentation of unorganized points and recognition of simple algebraic surfaces”, Ph.D. Dissertation, University of Technology Chemnitz, German, 2002.
[46] N. S. Sapidis and P. J. Besl, “Direct construction of polynomial surfaces from dense range images through region growing”, ACM Transactions on Graphics, Vol. 14, No. 2, pp. 271-200, 1995.
[47] A. Leonardis, A. Gupta and R. Bajcsy, “Segmentation of range images as the search for geometric parametric models”, International Journal of Computer Vision, Vol. 14, pp. 253-277, 1995.
[48] A. W. Fitzgibbon, D. Eggert and R. B. Fisher, “High-level CAD model acquisition from range images”, Computer-Aided Design, Vol. 29, No. 4, pp. 321-330, 1997.
[49] Y.H.Chen and C.Y.Liu, “Quadric surface extraction using genetic algorithms”, Computer-Aided Design, Vol. 31, No. 2, pp. 101-110, 1999.
[50] C. D. Bruyns, S. Senger, A. Menon, K. Montgomery, S. Wildermuth and R. Boyle, “A survey of interactive mesh-cutting techniques and a new method for implementing generalized interactive mesh cutting using virtual tools”, The Journal of Visualization and Computer Animation, Vol. 13, pp. 21-42, 2002.
[51] D. Bielser, and M. Gross, “Interactive simulation of surgical cuts”, Proceedings of Pacific Graphics, pp. 116-125, 2000.
[52] D. Bielser, P. Glardon, M. Teschner and M. Gross, “A state machine for real-time cutting of tetrahedral meshes”, Graphical Models, Vol. 66, No. 6, pp. 398-417, 2004.
[53] Y. Li, J. Yu, K. L. Ma and J. Shi, “3D paper-cut modeling and animation”, Computer Animation and Virtual Worlds, Vol. 18, pp. 395-403, 2007.
[54] H. Q. H. Viet, T. Kamada and H. T. Tanaka, “An algorithm for cutting 3D surface Meshes”, The 18th International Conference on Pattern Recognition, IEEE Computer Society , pp. 762-765, Hong Kong, 2006.
[55] W. C. Li, B. Levy and J. C. Paul, “Mesh editing with an embedded network of curves”, International Conference on Shape Modeling and Applications, pp. 63-71, 2005.
[56] K. C. H. Wong, T. Y. H. Siu, P. A. Heng and H. Sun, “Interactive volume cutting”, Proceedings of the Graphics Interface 1998 Conference, pp. 99-105, Vancouver, BC, Canada, 1998.
[57] H. W. Nienhuys and A. F. van der Stappen, “A surgery simulation supporting cuts and finite element deformation”, Proceedings of the 4th International Conference on MICCAI, pp. 145-152, Springer, Berlin, 2001.
[58] G. Slabaugh, V. Mihalef, and G. Unal, “A contour-based approach to 3D text labeling on triangulated surfaces”, Proceedings of the 5th International Conference on 3-D Digital Imaging and Modeling, pp. 416-423, 2005.
[59] C. D. Bruyns and S. Senger, “Technical Section: Interactive cutting of 3D surface meshes”, Computers & Graphics, Vol. 25, pp. 635-642, 2001.
[60] S. Cotin, H. Delingette and N. Ayache, “A hybrid elastic model for real-time cutting, deformations, and force feedback for surgery training and simulation”, The Visual Computer, Vol. 16, No. 8, pp. 437-452, 2000.
[61] H. W. Nienhuys and A. F. van der Stappen, “A Delaunay approach to interactive cutting in triangulated surfaces”, Proceedings of the 5th International Workshop Algorithmic Foundations of Robotics, pp. 113-130, Springer, Berlin, 2002.
[62] J. Verdera, V. Caselles, M. Bertalmio and G. Sapiro, “Inpainting surface holes”, IEEE International Conference on Image Processing, pp. 14-17, Barcelona, Spain, 2003.
[63] W. Schroeder, K. Martin and B. Lorensen, The visualization toolkit: An object oriented approach to 3D graphics (3rd ed.), Kitware, 2003.
[64] K. Lee, Principle of CAD/CAM/CAE Systems, Addison-Wesley, 1999.
[65] P. Benko, R. R. Martin and T. Varady, “Algorithms for reverse engineering boundary representation models”, Computer-Aided Design, Vol. 33, No. 11, pp. 839-851, 2001.
[66] P. Benko and T. Varady, “Segmentation methods for smooth point regions of conventional engineering objects”, Computer-Aided Design, Vol. 36, No. 6, pp. 511-523, 2004.
[67] A. Razdan and M. S. Bae, “A hybrid approach to feature segmentation of triangle meshes”, Computer-Aided Design, Vol. 35, No. 9, pp. 783-789, 2003.
[68] L. Moura and R. Kitney, “A direct method for least-square circle fitting”, Computer Physics Communications, Vol. 64, pp. 57-63, 1991.
[69] W. H. Press, S. A. Teukolsky, W. T. Vetterling and B. P. Flannery, Numerical recipes in C: The art of scientific computing (2nd ed.), Cambridge, New York, 1992.
[70] J. Y. Lai and H. C. Lai, “Repairing triangular meshes for reverse engineering applications”, Advances in Engineering Software, Vol. 37, pp. 667-683, 2006.
[71] J. Y. Lai, S. H. Shu and Y. C. Huang, “A cell subdivision strategy for r-nearest neighbors computation”, Journal of the Chinese Institute of Engineers, Vol. 29, No. 6, pp. 953-965, 2006.
[72] J. O’Rourke, Computational Geometry in C (2nd ed.), Cambridge University Press., New York, 2001.
[73] L. Piegl and W. Tiller, The NURBS book (2nd ed.), Springer-Verlag, Berlin, 1997.
|