參考文獻 |
[1] M. Botsch, M. Pauly, L. Kobbelt , P. Alliez, B. Lévy, S. Bischoff and C. Rössl, “Geometric Modeling Based on Polygonal Meshes”, Proceedings of the International Conference on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2007 Course Notes, 2007.
[2] J. Davies, S. Marschner, M. Garr and M. Levoy, “Filling Holes in Complex Surface Using Volumetric Diffusion”, Proceedings of First International Symposium on 3D Data Processing Visualization and Transmission, pp. 428-438, 2002.
[3] M. Bertalmio, G. Shapiro, V. Caselles and C. Ballester, “Image Inpainting”, Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, pp. 417-424, 2000.
[4] J. Verdera, V. Caselles, M. Bertalmio and G. Sapiro, “Inpainting Surface Holes”, Proceedings of IEEE International Conference on Image Processing, pp. 903-906, 2003.
[5] Y. Jun, “A Piecewise Hole Filling Algorithm in Reverse Engineering”, Computer-Aided Design, Vol. 37, No. 2, pp. 263-270, 2005.
[6] B. Girod, G. Greiner and H. Niemann, “Principles of 3D Image Analysis and Synthesis”, The International Series in Engineering and Computer Science, Vol. 556, Springer-Verlag Inc., New York, USA, 2000.
[7] J. Wang and O. Manuel, “A Hole Filling Strategy for Reconstruction of Smooth Surfaces in Range Images”, Proceedings of XVI Brazilian Symposium on Computer Graphics and Image Processing, pp. 11-18, 2003.
[8] P. Lancaster and K. Salkauskas, Curve and Surface Fitting - An Introduction, Academic Press Inc., Orlando FL, USA, 1986.
[9] J. Wang, O. Manuel and M. Oliverira, “Filling Holes on Locally Smooth Surface Reconstruction from Point Clouds”, Image and Vision Computing, Vol. 25, No. 1, pp. 103-113, 2007.
[10] T. Ju, “Robust Repair of Polygonal Models”, Proceedings of the SIGGRAPH'04, pp. 888-895, 2004.
[11] P. Liepa, “Filling Holes in Meshes”, Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp. 200-205, 2003.
[12] A. Sharf, M. Alexa and D. Cohen-Or, “Context-Based Surface Completion”, Proceedings of the SIGGRAPH'04, pp. 878-887, 2004.
[13] L. S. Tekumalla and E. Cohen, “A Hole-Filling Algorithm for Triangular Meshes”, Technical Report, UUCS-04-019, School of Computing, University of Utah, 2004.
[14] J. P. Pernot, G. Moraru and P. Véron, “Filling Holes in Meshes Using a Mechanical Model to Simulate the Curvature Variation Minimization”, Computers & Graphics, Vol. 30, No. 6, pp. 892-902, 2006.
[15] X. Chen, F. Schmitt, “Intrinsic Surface Properties from Surface Triangulation”, Proceedings of European Conference on Computer Vision, pp. 739-743, 1992.
[16] G. Lavoue, F. Dupont and A. Baskurt, “Curvature Tensor Based Triangle Mesh Segmentation with Boundary Rectification”, Proceedings of the Computer Graphics International, pp. 10-17, 2004.
[17] J. A. Thorpe, Elementary Topics in Differential Geometry, Springer, N.Y., 1979.
[18] G. Taubin., “Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation”, Proceedings of 5th International Conference on Computer Vision, pp. 902-907, 1995.
[19] K. Watanabe and A. Belyaev, “Detection of Salient Curvature Features on Polygonal Surfaces”, Computer Graphics Forum, Vol. 20, No. 3, pp. 385-392, 2001.
[20] P. Krsek, G. Lukács and R. R. Martin, “Algorithms for Computing Curvatures from Range Data”, Proceedings of the Mathematics of Surfaces VIII, pp. 1-16, 1998.
[21] T. Langer, A. G. Belyaev and H. P. Seidel, “Exact and Approximate Quadratures for Curvature Tensor Estimation”, Proceedings of Vision, Modeling, and Visualization 2005, pp. 421-428, 2005.
[22] J. F. Canny, “Finding Edges and Lines in Images”, Technical Report, TR. 720, Massachusetts Institute of Technology, 1983.
[23] R. Deriche, “Using Canny's Criteria to Derive a Recursively Implemented Optimal Edge Detector”, International Journal of Computer Vision, Vol. 1, No. 2, pp. 167-187, 1987.
[24] O. Monga and R. Deriche, “3D Edge Detection Using Recursive Filtering: Application to Scanner Images”, Proceedings of Computer Vision and Pattern Recognition, pp. 28-35, 1989.
[25] P. Saint-Marc and J. S. Chen, “Adaptive Smoothing: a General Tool for Early Vision”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, No. 6, pp. 514-529, 1991.
[26] A. G. Belyaev and E. Anoshkina, “Detection of Surface Creases in Range Data”, Proceedings of the Mathematics of Surfaces XI, Vol. 3604, pp. 50-61, 2005.
[27] Y. Ohtake and A. Belyaev “Automatic Detection of Geodesic Ridges and Ravines on Polygonal Surfaces”, The Journal of Three Dimensional Images, Vol. 15, No. 1, pp. 127-132, 2001.
[28] G. Lukács and L. Andor, “Computing Natural Division Lines on Free-Form Surfaces Based on Measured Data”, Proceedings of the International Conference on Mathematical Methods for Curves and Surfaces II Lillehammer, pp. 319-326, 1997.
[29] M. Garland and P. S. Heckbert, “Surface Simplification Using Quadric Error Metrics”, Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, pp. 209-216, 1997.
[30] M. Garland and P. S. Heckbert, “Quadric-Based Polygonal Surface Simplification”, Ph.D. Dissertation, Carnegie Mellon University, 1999.
[31] E. V. Anoshkina, A. G. Belyaev and T. L. Kunii, “Detection of Ridges and Ravines Based on Caustic Singularities”, International Journal of Shape Modeling, Vol. 1, No. 1, pp. 13-22, 1994.
[32] E. V. Anoshkina, A. G. Belyaev, O. G. Okunev and T. L. Kunii, “Ridges and Ravines: a Singularity Approach”, International Journal of Shape Modeling, Vol. 1, No. 1, pp. 1-12, 1994.
[33] A. G. Belyaev, Y. Ohtake and K. Abe, “Detection of Ridges and Ravines on Range Images and Triangular Meshes”, Proceedings of SPIE in Vision Geometry IX, Vol. 4117, pp. 146-154, 2000.
[34] G. Stylianou and G. Farin, “Crest Lines Extraction from 3D Triangulated Meshes”, Hierarchical and Geometrical Methods in Scientific Visualization, Springer Verlag, pp. 269-281, 2003.
[35] Y. Ohtake and A. Belyaev, “Automatic Detection of Geodesic Ridges and Ravines on Polygonal Surfaces”, The Journal of Three Dimensional Images, Vol. 15, No. 1, 2001.
[36] Y. Ohtake, A. G. Belyaev and H. P. Seidel, “Ridge-Valley Lines on Meshes Via Implicit Surface Fitting”, ACM Transactions on Graphics, Vol. 23, No. 3, pp. 609-612, 2004.
[37] S. Yoshizawa, A. G. Belyaev and H. P. Seidel, “Fast and Robust Detection of Crest Lines on Meshes”, Proceeding of ACM Symposium on Solid and Physical Modeling, pp. 227-232, 2005.
[38] S. K. Kim and C. H. Kim, “Finding Ridges and Valleys in a Discrete Surface Using a Modified MLS Approximation”, Computer-Aided Design, Vol. 37, No. 14, pp. 1533-1542, 2005.
[39] C. Rössl, L. Kobbelt and H. Seidel, “Extraction of Feature Lines on Triangulated Surfaces Using Morphological Operators”, Proceedings of Smart Graphics 2000, pp. 71-75 (2000).
[40] K. Demarsin, T. Volodine and D. Roose, “Detection of Feature Lines in a Point Cloud by Combination of First Order Segmentation and Graph Theory”, Technical Report, TW 440, Department of Computer Science, K. U. Leuven, Belgium, 2005.
[41] A. Hubeli and M. Gross, “Multiresolution Feature Extraction from Unstructured Meshes”, Proceedings of the conference on Visualization, pp. 287-294, 2001.
[42] L. Kobbelt and M. Botsch, “Feature Sensitive Mesh Processing”, Proceedings of the 19th Spring Conference on Computer Graphics, pp. 17-22, 2003.
[43] Y. W. Guo, Q. S. Peng, G. F. Hu and Jin. Wang, “Smooth Feature Line Detection for Meshes”, Journal of Zhejiang University Science, Vol. 6A, No. 5, pp. 460-468, 2005.
[44] T. Kanai and H. Suzuki, “Approximate Shortest Path on a Polyhedral Surface Based on Selective Refinement of the Discrete Graph and its Applications”, Proceedings of the Geometric Modeling and Processing, pp. 241-250, 2000.
[45] D. Martínez and L. Velho, “Geodesic Paths on Triangular Meshes”, Proceedings of the Computer Graphics and Image Processing, XVII Brazilian Symposium, pp. 210-217, 2004.
[46] G. P. Bonneau and S. Hahmann, “Smooth Polylines on Polygon Meshes”, Geometric Modeling for Scientific, Springer, pp. 69-84, 2003.
[47] I. Semenova, V. Savchenko and I. Hagiwara, “A New Approach for Improvement of Polygonal Meshes Representing Surfaces with Sharp Edges and Boundaries”, JSME International Journal, Series C, Vol. 48, No. 2, pp. 122-129, 2005.
[48] K. J. Chen, J. Y. Lai and W. D. Ueng, “An Extended Surface Fitting Algorithm for Random Data”, Journal of the Chinese Institute of Engineers, Vol. 30, No. 5, pp. 863-876, 2007.
[49] H. Pottmann and S. Leopoldseder, “A Concept for Parametric Surface Fitting which Avoids the Parametrization Problem”, Computer Aided Geometric Design, Vol. 20, No. 6, pp. 343-362, 2003.
[50] E. W. Dijkstra, “A Note on Two Problems in Connection with Graphs”, Numerische Mathematik, Springer Berlin, pp. 269-271, 1959.
[51] J. Pearl, Heuristics Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley Pub. Co., 1984.
[52] S. Russell and P. Norving, Artificial Intelligence: A Modern Approach 2/E, Prentice Hall, Upper Saddle River, N.J., 2003.
|