Issue No.03 - March (2011 vol.17)
pp: 357-367
Jianmin Zheng , Nanyang Technological University, Singapore
Juyong Zhang , Nanyang Technological University, Singapore
This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorithm that can add constraints to the random walks procedure and thus allows for a variety of intuitive user inputs. Second, we design an optimization process that uses the shortest graph path to derive a nice cut contour. Then a new mesh cutting algorithm is developed based on the constrained random walks plus the optimization process. Within the same computational framework, the new algorithm provides a novel user interface for interactive mesh cutting that supports three typical user inputs and also their combinations: 1) foreground/background seed inputs: the user draws strokes specifying seeds for “foreground” (i.e., the part to be cut out) and “background” (i.e., the rest); 2) soft constraint inputs: the user draws strokes on the mesh indicating the region which the cuts should be made nearby; and 3) hard constraint inputs: the marks which the cutting contour must pass. The algorithm uses feature sensitive metrics that are based on surface geometric properties and cognitive theory. The integration of the constrained random walks algorithm, the optimization process, the feature sensitive metrics, and the varieties of user inputs makes the algorithm intuitive, flexible, and effective as well. The experimental examples show that the proposed cutting method is fast, reliable, and capable of producing good results reflecting user intention and geometric attributes.
Computational geometry and object modeling, interaction techniques, geometric algorithms.
Jianmin Zheng, Juyong Zhang, "Interactive Mesh Cutting Using Constrained Random Walks", IEEE Transactions on Visualization & Computer Graphics, vol.17, no. 3, pp. 357-367, March 2011, doi:10.1109/TVCG.2010.57
[1] A. Shamir, "A Survey on Mesh Segmentation Techniques," Computer Graphics Forum, no. 11, pp. 1-18, Nov. 2007.
[2] Y. Lee, S. Leea, A. Shamirb, D. Cohen-Orc, and H.-P. Seideld, "Mesh Scissoring with Minima Rule and Part Salience," Computer Aided Geometric Design, vol. 22, no. 5, pp. 444-465, July 2005.
[3] S. Shlafman, A. Tal, and S. Katz, "Metamorphosis of Polyhedral Surfaces Using Decomposition," Computer Graphics Forum, vol. 21, no. 3, pp. 219-228, 2002.
[4] S. Katz and A. Tal, "Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts," Proc. ACM SIGGRAPH, pp. 954-961, 2003.
[5] R. Liu and H. Zhang, "Segmentation of 3D Meshes Through Spectral Clustering," Proc. Pacific Graphics, pp. 298-305, 2004.
[6] R. Liu and H. Zhang, "Mesh Segmentation Via Spectral Embedding and Contour Analysis," Computer Graphics Forum, vol. 26, no. 3, pp. 385-394, 2007.
[7] A.P. Mangan and R.T. Whitaker, "Partitioning 3d Surface Meshes Using Watershed Segmentation," IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 4, pp. 308-321, 1999.
[8] X. Li, T.W. Woon, T.S. Tan, and Z. Huang, "Decomposing Polygon Meshes for Interactive Applications," Proc. Symp. Interactive 3D Graphics, pp. 35-42, 2001.
[9] S. Katz, G. Leifman, and A. Tal, "Mesh Segmentation Using Feature Point and Core Extraction," The Visual Computer, vol. 21, nos. 8-10, pp. 649-658, 2005.
[10] T.-Y. Lee, P.-H. Lin, S.-U. Yan, and C.-H. Lin, "Mesh Decomposition Using Motion Information from Animation Sequences," J. Visualization and Computer Animation, vol. 16, nos. 3/4, pp. 519-529, 2005.
[11] T.-Y. Lee, Y.-S. Wang, and T.-G. Chen, "Segmenting a Deforming Mesh Into Near-Rigid Components," The Visual Computer, vol. 22, nos. 9-11, pp. 729-739, 2006.
[12] S. Schaefer and C. Yuksel, "Example-Based Skeleton Extraction," Proc. Symp. Geometry Processing, pp. 153-162, 2007.
[13] M. Attene, S. Katz, M. Mortara, G. Patanè, M. Spagnuolo, and A. Tal, "Mesh Segmentation—A Comparative Study," Proc. Shape Modeling Int'l, p. 7, 2006.
[14] X. Chen, A. Golovinskiy, and T. Funkhouser, "A Benchmark for 3D Mesh Segmentation," Proc. ACM SIGGRAPH, 2009.
[15] K.C.-H. Wong, T.Y.-H. Siu, P.-A. Heng, and H. Sun, "Interactive Volume Cutting," Proc. Graphics Interface, pp. 99-106, 1998.
[16] A. Gregory, A. State, M.C. Lin, D. Manocha, and M.A. Livingston, "Interactive Surface Decomposition for Polyhedral Morphing," The Visual Computer, vol. 15, no. 9, pp. 453-470, Dec. 1999.
[17] M. Zöckler, D. Stalling, and H.-C. Hege, "Fast and Intuitive Generation of Geometric Shape Transitions," The Visual Computer, vol. 16, no. 5, pp. 241-253, 2000.
[18] Y. Lee and S. Lee, "Geometric Snakes for Triangular Meshes," Computer Graphics Forum, vol. 21, no. 3, pp. 229-238, July 2002.
[19] Y. Lee, S. Lee, A. Shamir, D. Cohen-Or, and H.-P. Seidel, "Intelligent Mesh Scissoring Using 3D Snakes," Proc. Pacific Graphics, pp. 279-287, 2004.
[20] A. Clements and H. Zhang, "Minimum Ratio Contours on Surface Meshes," Proc. Shape Modeling Int'l, pp. 26-37, 2006.
[21] T. Funkhouser, M. Kazhdan, P. Shilane, P. Min, W. Kiefer, A. Tal, S. Rusinkiewicz, and D. Dobkin, "Modeling by Example," Proc. ACM SIGGRAPH, pp. 652-663, 2004.
[22] A. Sharf, M. Blumenkrants, A. Shamir, and D. Cohen-Or, "Snappaste: An Interactive Technique for Easy Mesh Composition," The Visual Computer, vol. 22, nos. 9-11, pp. 835-844, Sept. 2006.
[23] A.K. Sinop and L. Grady, "A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields a New Algorithm," Proc. Int'l Conf. Computer Vision (ICCV), pp. 560-572, 2007.
[24] Z. Ji, L. Liu, Z. Chen, and G. Wang, "Easy Mesh Cutting," Computer Graphics Forum, vol. 25, no. 3, pp. 219-228, Sept. 2006.
[25] Y.-S. Wang and T.-Y. Lee, "Wysiwyg: Mesh Decomposition for Static Models," Proc. Third Int'l Conf. Int'l Information Hiding and Multimedia Signal Processing (IIH-MSP '07), pp. 353-356, 2007.
[26] L. Grady, "Random Walks for Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1768-1783, Nov. 2006.
[27] Y.-K. Lai, S.-M. Hu, R.R. Martin, and P.L. Rosin, "Rapid and Effective Segmentation of 3D Models Using Random Walks," Computer Aided Geometric Design, vol. 26, no. 6, pp. 665-679, 2009.
[28] D.D. Hoffman and W. Richards, "Parts of Recognition," Cognition, vol. 18, pp. 65-96, 1984.
[29] D. Hoffman and M. Singh, "Salience of Visual Parts," Cognition, vol. 63, pp. 29-78, 1997.
[30] H.-Y.S. Lin, H.-Y.M. Liao, and J.-C. Lin, "Visual Salience-Guided Mesh Decomposition," IEEE Trans. Multimedia, vol. 9, no. 1, pp. 46-57, Jan. 2007.
[31] A. Golovinskiy and T. Funkhouser, "Randomized Cuts for 3D Mesh Analysis," Proc. ACM SIGGRAPH ASIA, Dec. 2008.
[32] H. Pottmann, T. Steiner, M. Hofer, C. Haider, and A. Hanbury, "The Isophotic Metric and Its Application to Feature Sensitive Morphology on Surfaces," Proc. European Conf. Computer Vision (ECCV), pp. 560-572, 2004.
[33] M. Meyer, M. Desbrun, P. Schroder, and A.H. Barr, "Discrete Differential-Geometry Operators for Triangulated 2-Manifolds," Visualization and Math., vol. 1, no. 3, pp. 35-57, 2002.
[34] G. Taubin, "Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation," Proc. Int'l Conf. Computer Vision (ICCV), pp. 902-907, 1995.
[35] J. Jia, J. Sun, C.-K. Tang, and H.-Y. Shum, "Drag-and-Drop Pasting," Proc. ACM SIGGRAPH, no. 3, pp. 631-636, July 2006.
[36] Y. Li, J. Sun, C.-K. Tang, and H.-Y. Shum, "Lazy Snapping," Proc. ACM SIGGRAPH, pp. 303-308, 2004.