References
- B. Chazelle, et al., 'Strategies for polyhedral surface decomposition: an experimental study,' Computational Geometry: Theory and Applications, 7, pp.327-342, 1997 https://doi.org/10.1016/S0925-7721(96)00024-7
- M. Attene, S. Katz, M. Mortara, G. Patane, M. Spagnuolo, and A. Tal, 'Mesh segmentation - a comparative study,' IEEE Int. Conf. on Shape Modeling and Applications, pp.14-25, 2006
- A. Shamir, 'A formulation of boundary mesh segmentation,' Proc. of 2nd Int. Sym. on 3D Data Processing, Visualization and Transmission (3DPVT'04), pp.82-89, 2004
- D. L. Page, A. F. Koschan, and M. A. Abidi, 'Perception based 3d triangle mesh segmentation using fast matching watersheds,' Conference on Computer Vision and Pattern Recognition, pp.27-32, 2003
- T. Srinak and C. Kambhamettu, 'A novel method for 3D surface mesh segmentation,' Proc. of the 6th IASTED International Conference on Computers, Graphics, and Imaging, pp.212-217, 2003
- M. Garland, A. Willmott, and P. S. Heckbert, 'Hierarchical face clustering on polygonal surfaces,' Proc. of the 2001 Symposium on Interactive 3D Graphics, pp.49-58, 2001
- S. Katz and A. Tal, 'Hierarchical mesh decomposition using fuzzy clustering and cuts,' ACM Transactions on Graphics (TOG), Vol.22, No.3, pp.954-961, 2003 https://doi.org/10.1145/882262.882369
- T. Kanungo, D. M. Mount, N. S. Netanyahu, A. D. Piatko, R. Silverman, and A. Y. Wu, 'An efficient k-means clustering algorithm: analysis and implementation,' IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.24, No.7, pp.881-892, 2002 https://doi.org/10.1109/TPAMI.2002.1017616
- A. P. Mangan and R. T. Whitaker, 'Partitioning 3D surface meshes using watershed segmentation,' IEEE Transactions on Visualization and Computer Graphics, Vol.5, No.4, pp.308-321, 1999 https://doi.org/10.1109/2945.817348
- T. K. Dey, J. Giesen, and S. Goswami, 'Shape segmentation and matching with flow discretization,' Proc. of the Workshop on Algorithms and Data Structures (WADS), Vol.2748, pp.25-36, 2003
- K. Wu and M. D. Levine, '3D part segmentation using simulated electrical charge distributions,' Proc. of the 1996 IEEE International Conference on Pattern Recognition (ICPR), pp.14-18, 1996
- D. Cohen Steiner, P. Alliez, and M. Desbrun, 'Variational shape approximation,' Proc. of the 31st Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH), pp.27-34, 2004
- D. D. Hoffman and W.A. Richards, 'Parts of recognition,' Cognition 18, 1984
- D. D. Hoffman and M. Singh, 'Salience of visual parts,' Cognition 63, 1997
- Y. Zhou and Z. Huang, 'Decomposing polygon meshes by means of critical points,' Proc. of MMM'04, 2004
- M. Mortara, G. Panae, M. Spagnuolo, B. Falcidieno and J. Rossignac, 'Blowing bubbles for the multi-scale analysis and decomposition of traingle meshes,' Algorithmica, Special Issues on Shape Algorithms, Vol. 38, No.2, pp.227-24, 2004 https://doi.org/10.1007/s00453-003-1051-4
- S. Katz, G. Leifman and A. Tal, 'Mesh segmentation using feature points and core etxraction,' Visual Computer Vol.21, 2005
- J. M. Lien and N. M. Amato, 'Approximate convex decomposition of polyhedra,' Technical Report TR06-002, Dept. of Computer Science, Texas A&M University, 2006
- Y.J. Lee, S.Y. Lee, A. Shamir, D. Cohen-Or and H.-P. Seidel, Intelligent mesh scissoring using 3d snakes, Proc. of Pacific Graphics, pp. 279-287, 2004
- Kwan-Hee Yoo and Jong-Sung Ha, User-steered methods for extracting geometric features over 3D Meshes,' Computer-Aided Design and Applications, Vol.2, No.1-4, 2005
- Kwan-Hee Yoo, Geometric livewire and geometric livelane for 3d meshes,' Journal of KIPS, Vol.2, No.1-4, 2005
- F. Yamaguchi, Curves and surfaces in Computer Aided Geometric Design, Springer-Berlag, 1988
- G. Taubin, 'Estimating the tensor of curvatures of a surface from a polyhedral approximation,' Proc. of International Conf. on Computer Vision, 1995
- A. Rosenfeld and E. Johnston, 'Angle detection in digital curves,' IEEE Transactions on Computers, Vol.22, pp.875-878, 1973 https://doi.org/10.1109/TC.1973.5009188
- A.D.C. Smith, The Folding of the Human Brain: from Shape to Function, University of London, PhD Dissertations, 1999
- G. Turk, 'Re-tiling polygonal surfaces,' ACM Computer Graphics (Proc. of SIGGRAPH '92), Vol.26, No.2, pp.55-64, 1992
- D. Cohen-Steiner and J.M. Morvan, 'Restricted Delaunay triangulations and normal cycle', Proc. of 19th Annual ACM Sym. on Computational Geometry, pp.237-246, 2003
- 하종성, '삼차원 제조성에 응용할 수 있는 다면체 단조성 의 특성화', 한국정보과학회 논문지(A), 제24권 11호, pp. 1051-1058, 1997
- T. Kanungo, et al., 'An efficient k-means clustering algorithm: analysis and implementation,' IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 881-892
- Computational geometry algorithm library, http://www.cgal.org
- P. Shilane, M. Kazhdan, P. Min and T. Funkhouser, 'The Princeton shape benchmark,' Proc. of Shape Modeling International, 2004