Keywords

#delaunay_refinement

Delaunay refinement

Algorithms for mesh generation

In mesh generation, Delaunay refinements are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented input to meet the quality requirements of the meshing application. Delaunay refinement methods include methods by Chew and by Ruppert.

Tue 10th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Delaunay refinement Delaunay triangulation Constrained Delaunay triangulation Steiner point (computational geometry) Triangulation (geometry) Computational geometry Jonathan Shewchuk Local feature size List of algorithms Farthest-first traversal
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.