Adaptive Quadrangular Segmentation of Triangle Meshes


Article Preview

A heuristic approach was presented to automatically partition a triangle meshes into a coarse quadrangular segmentation. The triangle mesh was firstly partitioned into a polygonal segmentation which will further be split into triangular and quadrangular patches. At last, the quadrangular segmentation was obtained by eliminating triangular patches according to their topological relations. The final segmentation consisted of pure-quadrangular patches with appropriate sizes according to the model’s geometric characteristics, and the features of input model were well captured. Experimental results showed that the algorithm was efficient and effective.



Edited by:

Kai Cheng, Yingxue Yao and Liang Zhou




H. M. Lv et al., "Adaptive Quadrangular Segmentation of Triangle Meshes", Applied Mechanics and Materials, Vols. 10-12, pp. 833-837, 2008

Online since:

December 2007




[1] I. Boier-Martin, H. Rushmeier and J.Y. Jin: Eurographics Symposium on Geometry Processing (Nice, France, July 8-10, 2004).

[2] F. Hétroy and D. Attali: Graphical Models, Vol. 65(1-3) (2003) p.131.

[3] S. Dong, P.T. Bremer, M. Garland, V. Pascucci and J.C. Hart: ACM Transactions on Graphics, Vol. 25 (2006) No. 3, p.1057.

[4] M. Eck and H. Hoppe: ACM SIGGRAPH'96 (New Orleans, America, August 4-9, 1996).

[5] S. Dong, S. Kircher and M. Garland: Computer aided geometric design, Vol. 22 (2005) No. 5, p.392.

[6] Y. Tong, P. Alliez, D. Cohen-Steiner and M. Desbrun: Eurographics symposium on geometry processing (Sardinia, Italy, June 26-28, 2006).

[7] H.M. Lu and Y. Wang: Journal of Huazhong University of Science and Technology (Nature Science) Chinese Vol. 35(Suppl. 1) (2007) p.57.

[8] S.H. Lo: Computers and Structures, Vol. 31 (1989) No. 3, p.421.

Fetching data from Crossref.
This may take some time to load.