Generation of Delaunay Meshes in Implicit Domains with Edge Sharpening

被引:2
作者
Belokrys-Fedotov, A. I. [1 ]
Garanzha, V. A.
Kudryavtseva, L. N.
机构
[1] Russian Acad Sci, Dorodnicyn Comp Ctr, Fed Res Ctr Comp Sci & Control, Moscow 119333, Russia
基金
俄罗斯基础研究基金会;
关键词
Delaunay meshes; elastic networks; sharp edge sharpening; variational method; surface reconstruction; implicitly specified domains;
D O I
10.1134/S096554251611004X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A variational algorithm for the construction of 3D Delaunay meshes in implicit domains with a nonsmooth boundary is proposed. The algorithm is based on the self-organization of an elastic network in which each Delaunay edge is interpreted as an elastic strut. The elastic potential is constructed as a combination of the repulsion potential and the sharpening potential. The sharpening potential is applied only on the boundary and is used to minimize the deviation of the outward normals to the boundary faces from the direction of the gradient of the implicit function. Numerical experiments showed that in the case when the implicit function specifying the domain is considerably different from the signed distance function, the use of the sharpening potential proposed by Belyaev and Ohtake in 2002 leads to the mesh instability. A stable version of the sharpening potential is proposed. The numerical experiments showed that acceptable Delaunay meshes for complex shaped domains with sharp curved boundary edges can be constructed.
引用
收藏
页码:1901 / 1918
页数:18
相关论文
共 17 条
[1]  
Belousova L. N., 2008, T 51 NAUCHN K SOVR P, V2, P98
[2]  
Boissonat J.-D., 2007, EFFECTIVE COMPUTATIO, P181
[3]   Unstructured Tetrahedral Mesh Generation Technology [J].
Danilov, A. A. .
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2010, 50 (01) :139-156
[4]  
Frey J. L., 2000, MESH GENERATION APPL
[5]   Variational method for untangling and optimization of spatial meshes [J].
Garanzha, V. A. ;
Kudryavtseva, L. N. ;
Utyuzhnikov, S. V. .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2014, 269 :24-41
[6]   Generation of Three-Dimensional Delaunay Meshes from Weakly Structured and Inconsistent Data [J].
Garanzha, V. A. ;
Kudryavtseva, L. N. .
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2012, 52 (03) :427-447
[7]   'Ultimate' robustness in meshing an arbitrary polyhedron [J].
George, PL ;
Borouchaki, H ;
Saltel, E .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2003, 58 (07) :1061-1089
[8]   Grid construction for discretely defined configurations [J].
Kofanov, A. V. ;
Liseikin, V. D. .
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2013, 53 (06) :759-765
[9]   Isosurface stuffing: Fast tetrahedral meshes with good dihedral angles [J].
Labelle, Francois ;
Shewchuk, Jonathan Richard .
ACM TRANSACTIONS ON GRAPHICS, 2007, 26 (03)
[10]  
Liseikin VD, 2010, SCI COMPUT, P1, DOI 10.1007/978-90-481-2912-6