.png){kind=icon}
Return
WELL-CENTERED TRIANGULATION
.png){kind=icon}
OA
AI
DOI：10.1137/090748214.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have optimality properties and relationships to Delaunay and minmax angle triangulations. We present an iterative algorithm that seeks to transform a given triangulation in two or three dimensions into a well-centered one by minimizing a cost function and moving the interior vertices while keeping the mesh connectivity and boundary vertices fixed. The cost function is a direct result of a new characterization of well-centeredness in arbitrary dimensions that we present. Ours is the first optimization-based heuristic for well-centeredness and the first one that applies in both two and three dimensions. We show the results of applying our algorithm to small and large two-dimensional meshes, some with a complex boundary, and obtain a well-centered tetrahedralization of the cube. We also show numerical evidence that our algorithm preserves gradation and that it improves the maximum and minimum angles of acute triangulations created by the best known previous method.
Keywords:
well-centered
meshing
mesh optimization
acute
triangulation
discrete exterior calculus
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
Maximizing Weight Loss After Roux-en-Y Gastric Bypass May Decrease Risk of Incident Organ Cancer
OAAI
OAAIShareSaveDependence of Thermal Boundary Conductance on Interfacial Mixing at the Chromium-Silicon Interface
PREAI
ShareSaveAxial distribution of emission and rate of deposition of diamond-like film in r.f. discharges in CH4
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more