Instant Field-Aligned Meshes

被引:226
作者
Jakob, Wenzel [1 ]
Tarini, Marco [2 ]
Panozzo, Daniele [1 ]
Sorkine-Hornung, Olga [1 ]
机构
[1] Swiss Fed Inst Technol, Zurich, Switzerland
[2] Univ Insubria, Como, CO, Italy
来源
ACM TRANSACTIONS ON GRAPHICS | 2015年 / 34卷 / 06期
关键词
remeshing; triangulation; quadrangulation; N-RoSy; extrinsic smoothing; point cloud; range scan;
D O I
10.1145/2816795.2818078
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a novel approach to remesh a surface into an isotropic triangular or quad-dominant mesh using a unified local smoothing operator that optimizes both the edge orientations and vertex positions in the output mesh. Our algorithm produces meshes with high isotropy while naturally aligning and snapping edges to sharp features. The method is simple to implement and parallelize, and it can process a variety of input surface representations, such as point clouds, range scans and triangle meshes. Our full pipeline executes instantly (less than a second) on meshes with hundreds of thousands of faces, enabling new types of interactive workflows. Since our algorithm avoids any global optimization, and its key steps scale linearly with input size, we are able to process extremely large meshes and point clouds, with sizes exceeding several hundred million elements. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexity and provide our cross-platform reference implementation in the supplemental material.
引用
收藏
页数:15
相关论文
共 66 条
[1]   Multilevel solvers for unstructured surface meshes [J].
Aksoylu, B ;
Khodakovsky, A ;
Schröder, P .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 26 (04) :1146-1165
[2]   Anisotropic polygonal remeshing [J].
Alliez, P ;
Cohen-Steiner, D ;
Devillers, O ;
Lévy, B ;
Desbrun, M .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :485-493
[3]  
Alliez P, 2002, ACM T GRAPHIC, V21, P347, DOI 10.1145/566570.566588
[4]  
ALLIEZ P., 2005, GRAPHICAL MODELS, V67, P3
[5]  
ANDERSON R. J., 1991, P STOC
[6]  
[Anonymous], ACM T GRAPH
[7]  
[Anonymous], ACM T GRAPH
[8]  
[Anonymous], ACM T GRAPH
[9]  
[Anonymous], P ACM SIGGRAPH
[10]  
Belkin M., 2009, P ACM SIAM S DISCR A