Payan, F.Roudet, C.Sauvage, B.Deussen, Oliver and Zhang, Hao (Richard)2015-03-022015-03-022015https://doi.org/10.1111/cgf.12461https://diglib.eg.org/handle/10.1111/cgf12461Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades. We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multiresolution analysis.In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades.We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.Semi‐Regular Triangle Remeshing: A Comprehensive Study10.1111/cgf.12461