This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing Length-Preserved Free Boundary for Quasi-Developable Mesh Segmentation
January/February 2008 (vol. 14 no. 1)
pp. 25-36
Stretch-free surface flattening has been requested by a variety of applications. At present, the most difficult problem is how to segment a given model into nearly developable atlases so that a nearly stretch-free flattening can be computed. The criterion for segmentation is needed to evaluate the possibility of flattening a given surface patch, which should be fast computed. In this paper, we present a method to compute the length-preserved free boundary (LPFB) of a mesh patch which speeds up the mesh parameterization. The distortion on parameterization can then be employed as the criterion in a trial-and-error algorithm for segmenting a given model into nearly developable atlases. The computation of LPFB is formulated as a numerical optimization problem in the angle space, where we are trying to optimize the angle excesses on the boundary while preserving the constraints derived from the closed-path theorem and the length preservation.

[1] P.N. Azariadis and N.A. Aspragathos, “Design of Plane Development of Doubly Curved Surface,” Computer-Aided Design, vol. 29, pp. 675-685, 1997.
[2] M. Aono, D.E. Breen, and M.J. Wozny, “Modeling Methods for the Design of 3D Broadcloth Composite Parts,” Computer-Aided Design, vol. 33, pp. 989-1007, 2001.
[3] M. Aono, D.E. Breen, and M.J. Wozny, “Fitting a Woven-Cloth Model to a Curved Surface: Mapping Algorithms,” Computer-Aided Design, vol. 26, pp. 278-292, 1994.
[4] D. Cohen-Steiner, P. Alliez, and M. Desbrun, “Variational Shape Approximation,” Proc. ACM SIGGRAPH '04, vol. 23, pp. 905-914, 2004.
[5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[6] J.W. Demmel, S.C. Eisenstat, J.R. Gilbert, X.S. Li, and J.W.H. Liu, “A Supernodal Approach to Sparse Partial Pivoting,” SIAM J. Matrix Analysis and Applications, vol. 20, no. 3, pp. 720-755, 1999.
[7] M. Desbrun, M. Meyer, and P. Alliez, “Intrinsic Parameterizations of Surface Meshes,” Proc. Ann. Conf. European Assoc. for Computer Graphics (Eurographics '02), vol. 21, pp. 209-218, 2002.
[8] M.P. Do Carmo, Differential Geometry of Curves and Surfaces. Prentice Hall, 1976.
[9] R.O. Duda, P.E. Hart, and D.G. Stork, Pattern Classification, seconded., pp. 20-160. Wiley, 2001.
[10] M.S. Floater and K. Hormann, “Surface Parameterization: A Tutorial and Survey,” Advances in Multiresolution for Geometric Modelling, N.A. Dodgson, M.S. Floater, and M.A. Sabin, eds., pp.157-186, Springer, 2005.
[11] X. Gu and S.-T. Yau, “Global Conformal Surface Parameterization,” Proc. 2003 Eurographics/ACM SIGGRAPH Symp. Geometry Processing, pp. 127-137, 2003.
[12] K. Hormann and G. Greiner, “MIPS: An Efficient Global Parametrization Method,” Curve and Surface Design Saint-Malo 1999, P.-J. Laurent, P. Sablonnire, and L. Schumaker, eds., pp. 153-162, Vanderbilt Univ. Press, 2000.
[13] D. Julius, V. Kraevoy, and A. Sheffer, “D-Charts: Quasi-Developable Mesh Segmentation,” Proc. Ann. Conf. European Assoc. for Computer Graphics (Eurographics '05), vol. 24, pp. 581-590, 2005.
[14] Z. Karni, C. Gotsman, and S.J. Gortler, “Free-Boundary Linear Parameterization of 3D Meshes in the Presence of Constraints,” Proc. Shape Modeling Int'l, pp. 266-275, June 2005.
[15] S. Katz, G. Leifman, and A. Tal, “Mesh Segmentation Using Feature Point and Core Extraction,” The Visual Computer, special issue of pacific graphics 2005, vol. 21, nos. 8-10, pp. 649-658, 2005.
[16] S. Katz and A. Tal, “Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts,” Proc. ACM SIGGRAPH '03, vol. 22, no. 3, pp. 954-961, 2003.
[17] V. Kraevoy, A. Sheffer, and C. Gotsman, “Matchmaker: Constructing Constrained Texture Maps,” Proc. ACM SIGGRAPH '03, vol. 22, no. 3, pp. 326-333, 2003.
[18] Y. Lee, H.-.S. Kim, and S. Lee, “Mesh Parameterization with a Virtual Boundary,” Computers and Graphics, vol. 26, pp. 677-686, 2002.
[19] B. Levy, S. Petitjean, N. Ray, and J. Maillot, “Least Squares Conformal Maps for Automatic Texture Atlas Generation,” Proc. ACM SIGGRAPH '02, vol. 21, pp. 362-371, 2002.
[20] J. Maillot, H. Yahia, and A. Verroust, “Interactive Texture Mapping,” Proc. ACM SIGGRAPH '93, pp. 27-34, 1993.
[21] J. Mitani and H. Suzuki, “Making Papercraft Toy from Meshes Using Strip-Based Approximate Unfolding,” Proc. ACM SIGGRAPH '04, vol. 23, no. 3, pp. 259-263, 2004.
[22] J. McCartney, B.K. Hinds, and B.L. Seow, “The Flattening of Triangulated Surfaces Incorporating Darts and Gussets,” Computer-Aided Design, vol. 31, pp. 249-260, 1999.
[23] M. Meyer, M. Desbrun, P. Schroder, and A.H. Barr, “Discrete Differential-Geometry Operators for Triangulated 2-Manifolds,” Proc. Visualization and Math., 2002.
[24] M.E. Mortenson, Geometric Modeling, second ed., pp. 282-310. Wiley, 1997.
[25] J. Nocedal and S.J. Wright, Numerical Optimization. Springer, 1999.
[26] W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, pp. 71-89. Cambridge Univ. Press, 1995.
[27] P. Sander, S. Gortler, J. Snyder, and H. Hoppe, “Signal-Specialized Parametrization,” Proc. Eurographics Workshop Rendering 2002, pp.87-100, 2002.
[28] P.V. Sander, J. Snyder, S.J. Gortler, and H. Hoppe, “Texture Mapping Progressive Meshes,” Proc. ACM SIGGRAPH '01, pp.409-416, 2001.
[29] P.V. Sander, Z. Wood, S.J. Gortler, J. Snyder, and H. Hoppe, “Multi-Chart Geometry Images,” Proc. First Symp. Geometry Processing, pp. 146-155, 2003.
[30] L. Saroul, O. Figueiredo, and R.D. Hersch, “Distance Preserving Flattening of Surface Sections,” IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 1, pp. 26-35, Jan./Feb. 2006.
[31] T.W. Sederberg, P. Gao, G. Wang, and H. Mu, “2-D Shape Blending: An Intrinsic Solution to the Vertex Path Problem,” Proc. ACM SIGGRAPH '93, pp. 15-18, 1993.
[32] I. Shatz, A. Tal, and G. Leifman, “Paper Craft Models from Meshes,” Proc. Pacific Conf. Computer Graphics and Applications (Pacific Graphics '06), vol. 22, nos. 9-11, pp. 825-834, 2006.
[33] A. Sheffer, “Spanning Tree Seams for Reducing Parameterization Distortion of Triangulated Surfaces,” Proc. Int'l Conf. Shape Modeling and Applications 2002, pp. 61-66, 2002.
[34] A. Sheffer and E. de Sturler, “Parameterization of Faceted Surfaces for Meshing Using Angle Based Flattening,” Eng. with Computers, vol. 17, no. 3, pp. 326-337, 2001.
[35] A. Sheffer, B. Lévy, M. Mogilnitsky, and A. Bogomjakov, “ABF++: Fast and Robust Angle Based Flattening,” ACM Trans. Graphics, vol. 24, no. 2, pp. 311-330, 2005.
[36] G. Stylianou and G. Farin, “Crest Lines for Surface Segmentation and Flattening,” IEEE Trans. Visualization and Computer Graphics, vol. 10, no. 5, pp. 536-544, Sept./Oct. 2004.
[37] O. Sorkine, D. Cohen-Or, R. Goldenthal, and D. Lischinski, “Bounded-Distortion Piecewise Mesh Parameterization,” Proc. IEEE Visualization (VIS '02), pp. 355-362, 2002.
[38] G. Taubin, “Linear Anisotropic Mesh Filtering,” Technical Report TR-RC2213, IBM Research, 2001.
[39] C.C.L. Wang, S.S.F. Smith, and M.M.F. Yuen, “Surface Flattening Based on Energy Model,” Computer-Aided Design, vol. 34, no. 11, pp. 823-833, 2002.
[40] C.C.L. Wang and K. Tang, “Achieving Developability of a Polygonal Surface by Minimum Deformation: A Study of Global and Local Optimization Approaches,” The Visual Computer, vol. 20, pp. 521-539, 2004.
[41] C.C.L. Wang, K. Tang, and B.M.L. Yeung, “Freeform Surface Flattening by Fitting a Woven Mesh Model,” Computer-Aided Design, vol. 37, pp. 799-814, 2005.
[42] H. Yamauchi, S. Lee, Y. Lee, Y. Ohtake, A. Belyaev, and H.-P. Seidel, “Feature Sensitive Mesh Segmentation with Mean Shift,” Proc. Shape Modeling Int'l, pp. 236-243, 2005.
[43] H. Yamauchi, S. Gumhold, R. Zayer, and H.-P. Seidel, “Mesh Segmentation Driven by Gaussian Curvature,” The Visual Computer, vol. 21, nos. 8-10, pp. 659-668, 2005.
[44] J. Yan, X. Yang, P. Shi, and D. Zhang, “Mesh Parameterization by Minimizing the Synthesized Distortion Metric with the Coefficient-Optimizing Algorithm,” IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 1, pp. 83-92, Jan./Feb. 2006.
[45] S. Yoshizawa, A.G. Belyaev, and H.-P. Seidel, “A Fast and Simple Stretch-Minimizing Mesh Parameterization,” Proc. Shape Modeling and Applications, pp. 200-208, June 2004.
[46] R. Zayer, C. Rössl, and H.-P. Seidel, “Setting the Boundary Free: A Composite Approach to Surface Parameterization,” Proc. Third Eurographics Symp. Geometry Processing, pp. 91-100, 2005.
[47] E. Zhang, K. Mischaikow, and G. Turk, “Feature-Based Surface Parameterization and Texture Mapping,” ACM Trans. Graphics, vol. 24, no. 1, pp. 1-27, 2005.
[48] K. Zhou, J. Synder, B. Guo, and H.-Y. Shum, “Iso-Charts: Stretch-Driven Mesh Parameterization Using Spectral Analysis,” Proc. Eurographics Symp. Geometry Processing, July 2004.
[49] G. Zigelman, R. Kimmel, and N. Kiryati, “Texture Mapping Using Surface Flattening via Multidimensional Scaling,” IEEE Trans. Visualization and Computer Graphics, vol. 8, no. 2, pp. 198-207, Apr.-June 2002.

Index Terms:
Boundary representations, Geometric algorithms, languages, and systems
Citation:
Charlie Wang, "Computing Length-Preserved Free Boundary for Quasi-Developable Mesh Segmentation," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 1, pp. 25-36, Jan.-Feb. 2008, doi:10.1109/TVCG.2007.1067
Usage of this product signifies your acceptance of the Terms of Use.