Feature sensitive remeshing

被引:17
作者
Vorsatz, J [1 ]
Rössl, C [1 ]
Kobbelt, LP [1 ]
Seidel, HP [1 ]
机构
[1] Max Planck Inst Informat, Saarbrucken, Germany
关键词
D O I
10.1111/1467-8659.00532
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Remeshing artifacts are a fundamental problem when converting a given geometry into a triangle mesh. We propose a new remeshing technique that is sensitive to features. First, the resolution of the mesh is iteratively adapted by a global restructuring process which additionally optimizes the connectivity. Then a particle system approach evenly distributes the vertices across the original geometry. To exactly find the features we extend this relaxation procedure by an effective mechanism to attract the vertices to feature edges. The attracting force is imposed by means of a hierarchical curvature field and does not require any thresholding parameters to classify the features.
引用
收藏
页码:C393 / C401
页数:9
相关论文
共 18 条
[1]  
[Anonymous], COMPUT GRAPH FORUM
[2]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[3]  
Desbrun M, 1999, COMP GRAPH, P317, DOI 10.1145/311535.311576
[4]  
Eck M., 1995, Computer Graphics Proceedings. SIGGRAPH 95, P173, DOI 10.1145/218380.218440
[5]  
Garland M., 1997, Computer Graphics Proceedings, SIGGRAPH 97, P209, DOI 10.1145/258734.258849
[6]  
Hoppe H., 1993, Computer Graphics Proceedings, P19, DOI 10.1145/166117.166119
[7]  
HOPPE H, 1996, SIGGRAPH 96, P99, DOI DOI 10.1145/237170.237216
[8]  
Kobbelt L., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P105, DOI 10.1145/280814.280831
[9]  
Kobbelt L, 1998, GRAPHICS INTERFACE '98 - PROCEEDINGS, P43
[10]  
KOBBELT L, 2000, COMPUT GRAPH FORUM, V19, P249