A Study on Delaunay Terminal Edge Method

Rivara, María‐Cecilia

doi:10.1007/978-3-540-34958-7_31

Cited by 3 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• avoiding slivers by inserting points into the neighborhoods of circumcenters [7,11], • reducing the final mesh size by picking specific "off-center" positions [23], and • creating a hierarchy of nested meshes [18] by choosing points on the existing mesh edges [17].…”

Section: Proof Of Good Grading the Quantity D (V) Is Defined As The mentioning

confidence: 99%

“…One of the central questions in Delaunay refinement research has been the choice of the positions for the new points. The traditional approach uses circumcenters of mesh elements; however, a number of other locations have been used to achieve various mesh optimizations [17,7,11,10,23,3]. Our goal is to provide a single theoretical framework which makes it possible to develop multiple custom point placement techniques by means of defining special regions, such that any Delaunay refinement-based technique which places points in these regions will automatically be endowed with termination and good grading guarantees.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Generalized Insertion Region Guides for Delaunay Mesh Refinement

Chernikov¹,

Chrisochoides²

2012

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

Mesh generation by Delaunay refinement is a widely used technique for constructing guaranteed quality triangular and tetrahedral meshes. The quality guarantees are usually provided in terms of the bounds on circumradius-to-shortest-edge ratio and on the grading of the resulting mesh. Traditionally circumcenters of skinny elements and middle points of boundary faces and edges are used for the positions of inserted points. However, recently variations of the traditional algorithms are being proposed that are designed to achieve certain optimization objectives by inserting new points in neighborhoods of the center points. In this paper we propose a general approach to the selection of point positions by defining one-, two-, and three-dimensional selection regions such that any point insertion strategy based on these regions is automatically endowed with the theoretical guarantees proven here. In particular, for the input models defined by planar linear complexes under the assumption that no input angle is less than 90 • , we prove the termination of the proposed generalized algorithm, as well as the fidelity and good grading of the resulting meshes.

show abstract