
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChuanChu Kuo, HongTzong Yau, "A New Combinatorial Approach to Surface Reconstruction with Sharp Features," IEEE Transactions on Visualization and Computer Graphics, vol. 12, no. 1, pp. 7382, January/February, 2006.  
BibTex  x  
@article{ 10.1109/TVCG.2006.2, author = {ChuanChu Kuo and HongTzong Yau}, title = {A New Combinatorial Approach to Surface Reconstruction with Sharp Features}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, number = {1}, issn = {10772626}, year = {2006}, pages = {7382}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2006.2}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  A New Combinatorial Approach to Surface Reconstruction with Sharp Features IS  1 SN  10772626 SP73 EP82 EPD  7382 A1  ChuanChu Kuo, A1  HongTzong Yau, PY  2006 KW  Surface reconstruction KW  Voronoi diagram KW  Delaunay triangulation KW  region growing KW  sharp feature reconstruction. VL  12 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—This paper presents a new combinatorial approach to surface reconstruction with sharp features. Different from other postprocessing methods, the proposed method provides a systematic way to identify and reconstruct sharp features from unorganized sample points in one integrated reconstruction process. In addition, unlike other approximation methods, the reconstructed triangulated surface is guaranteed to pass through the original sample points. In this paper, the sample points in the sharp regions are defined as characteristic vertices (
[1] M. Attene, B. Falcidieno, J. Rossignac, and M. Spagnuolo, “EdgeSharpener: Recovering Sharp Features in Triangulations of NonAdaptively ReMeshed Surfaces,” Proc. Eurographics Symp. Geometry Processing, pp. 6271, 2003.
[2] J.D. Boissonnat, “Geometric Structures for ThreeDimensional Shape Representation,” ACM Trans. Graphics, vol. 3, no. 4, pp. 266286, 1984.
[3] H. Edelsbrunner and E.P. Mucke, “ThreeDimensional Alpha Shapes,” ACM Trans. Graphics, vol. 13, no. 1, pp. 4372, 1994.
[4] N. Amenta, M. Bern, and M. Kamvysselis, “A New VoronoiBased Surface Reconstruction Algorithm,” Proc. SIGGRAPH '98, pp. 415421, 1998.
[5] N. Amenta, S. Choi, and R.V. Kolluri, “The Power Crust,” Proc. Sixth ACM Symp. Solid Modeling and Applications, pp. 249266, 2001.
[6] N. Amenta, S. Choi, T.K. Dey, and N. Leekha, “A Simple Algorithm for Homeomorphic Surface Reconstruction,” Int'l J. Computational Geometry and Applications, vol. 12, pp. 125141, 2002.
[7] T.K. Dey, J. Giesen, N. Leekha, and R. Wenger, “Detecting Boundaries for Surface Reconstruction Using CoCones,” Int'l J. Computer Graphics and CAD/CAM, vol. 16, pp. 141159, 2001.
[8] T.K. Dey and S. Goswami, “Tight Cocone: A WaterTight Surface Reconstructor,” Proc. Eighth ACM Symp. Solid Modeling and Applications, pp. 127134, 2003.
[9] H.T. Yau, C.C. Kuo, and C.H. Yeh, “Extension of Surface Reconstruction Algorithm to the Global Stitching and Repairing of STL Models,” ComputerAided Design, vol. 35, no. 5, pp. 477486, 2002.
[10] C.C. Kuo and H.T. Yau, “Reconstruction of Virtual Parts from Unorganized Scanned Data for Automated Dimensional Inspection,” J. Computing and Information Science in Eng. (JCISE), Trans. ASME, vol. 3, no. 1, pp. 7686, 2003.
[11] E. Mencl and H. Müller, “GraphBased Surface Reconstruction Using Structures in Scattered Point Sets,” Proc. CGI '98 (Computer Graphics Int'l), pp. 298311, 1998.
[12] F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin, “The BallPivoting Algorithm for Surface Reconstruction,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 4, pp. 349359, Oct.Dec. 1999.
[13] M. Gopi and S. Krishnan, “A Fast and Efficient ProjectionBased Approach for Surface Reconstruction,” Int'l J. HighPerformance Computer Graphics, Multimedia and Visualization, vol. 1, no. 1, pp. 112, 2000.
[14] S. Petitjean and E. Boyer, “Regular and NonRegular Point Sets: Properties and Reconstruction,” Computational Geometry Theory and Applications, vol. 19, pp. 101126, 2001.
[15] J. Huang and C.H. Menq, “Combinatorial Manifold Mesh Reconstruction and Optimization from Unorganized Points with Arbitrary Topology,” ComputerAided Design, vol. 34, no. 2, pp. 149165, 2002.
[16] D. CohenSteiner, “A Greedy Delaunay Based Surface Reconstruction Algorithm,” research report, INRIA, 2002.
[17] C.C. Kuo and H.T. Yau, “A DelaunayBased RegionGrowing Approach to Surface Reconstruction from Unorganized Points,” ComputerAided Design, vol. 37, pp. 825835, 2005.
[18] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Surface Reconstruction from Unorganized Points,” Proc. SIGGRAPH '92, pp. 7178, 1992.
[19] B. Curless and M. Levoy, “A Volumetric Method for Building Complex Models from Range Images,” Proc. SIGGRAPH '96, pp. 303312, 1996.
[20] F. Bernardini, C. Bajaj, J. Chen, and D. Schikore, “Automatic Reconstruction of 3D CAD Models from Digital Scans,” Int'l J. Computational Geometry Theory and Applications, vol. 9, nos. 45, pp. 327370, 1999.
[21] J.D. Boissonnat and F. Cazals, “Smooth Surface Reconstruction via Natural Neighbor Interpolation of Distance Functions,” Proc. 16th ACM Symp. Computational Geometry, pp. 223232, 2000.
[22] J.C. Carr, R.K. Beatson, J.B. Cherrie, T.J. Mitchell, W.R. Fright, B.C. McCallum, and T.R. Evans, “Reconstruction and Representation of 3D Objects with Radial Basis Functions,” Proc. SIGGRAPH '01, pp. 6776, 2001.
[23] W. Lorensen and H. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics (Proc. SIGGRAPH '87), pp. 163169, 1987.
[24] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 191226, 1993.
[25] L. Kobbelt, M. Botsch, U. Schwanecke, and H.P. Seidel, “Feature Sensitive Surface Extraction from Volume Data,” Proc. SIGGRAPH '01, pp. 5766, 2001.
[26] Y. Ohtake, A.R. Belyaev, M. Alexa, G. Turk, and H.P. Seidel, “MultiLevel Partition of Unity Implicits,” Proc. SIGGRAPH 2003, pp. 463470, 2003.
[27] H.T. Yau and C.C. Kuo, “Virtual CMM and Virtual Part for Intelligent Dimensional Inspection,” Proc. 2002 JapanUSA Symp. Flexible Automation, pp. 12891296, 2002.
[28] L.P. Chew, “GuaranteedQuality Triangular Meshes,” Report TR 89983, Computer Science Dept., Cirnel Univ., Ithaca, N.Y., 1989.
[29] J. Ruppert, “A Delaunay Refinement Algorithm for Quality 2Dimensional Mesh Generation,” J. Algorithms, vol. 18, pp. 548585, 1995.
[30] T.K. Dey, C. Bajaj, and K. Sugihara, “On Good Triangulations in Three Dimensions,” Int'l J. Computational Geometry and Applications, vol. 2, pp. 7595, 1990.
[31] J. Shewchunk, “Tetrahedral Mesh Generation by Delaunay Refinement,” Proc. 16th ACM Symp. Computational Geometry, pp. 8695, 1998.
[32] H. Edelsbrunner and D. Guoy, “SinkInsertion for Mesh Improvement,” Int'l J. Foundations of Computer Science, vol. 13, pp. 223242, 2002.
[33] F. Aurenhammer, “Voronoi Diagrams— A Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 23, no. 3, pp. 345405, 1991.
[34] H. Edelsbrunner, “180 Wrapped Tubes,” J. Universal Computer Science, vol. 7, pp. 379399, 2001.
[35] http:/www.cgal.org/, 2005.
[36] J.D. Boissonnat, O. Devillers, M. Teillaud, and M. Yvinec, “Triangulations in CGAL,” Proc. 16th ACM Symp. Computational Geometry, pp. 1118, 2000.
[37] O. Devillers, “Improved Incremental Randomized Delaunay Triangulation,” Proc. 14th ACM Symp. Computational Geometry, pp. 106115, 1998.
[38] http://www.cis.ohiostate.edu/tamaldeycocone.html , 2005.