NASA NTRS · 19930000052
Advancing-Front Algorithm For Delaunay Triangulation
Abstract
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.
Keep this discovery
Explore connections, maps & timelines
Merriam, Marshal L.. 1993-01-01. Advancing-Front Algorithm For Delaunay Triangulation. https://engineeringpapers.com/record/nasa%3A19930000052/advancing-front-algorithm-for-delaunay-triangulation
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.