Efficient algorithm performs Delaunay triangulation to generate unstructured grids for use in computing two-dimensional flows. Once grid generated, one can optionally call upon additional subalgorithm that removes diagonal lines from quadrilateral cells nearly rectangular. Resulting approximately rectangular grid reduces cost per iteration of flow-computing algorithm.
Advancing-Front Algorithm For Delaunay Triangulation
NASA Tech Briefs ; 17 , 1
1993-01-01
Miscellaneous
No indication
English
Delaunay Triangulation in d-Dimensional Space: A Triangulation-Growth Algorithm
British Library Conference Proceedings | 1995
|Research on Satellite Selection Algorithm Based on Delaunay Triangulation Projection
British Library Conference Proceedings | 2019
|