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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Advancing-Front Algorithm For Delaunay Triangulation


    Contributors:

    Published in:

    Publication date :

    1993-01-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English







    Delaunay Triangulation in d-Dimensional Space: A Triangulation-Growth Algorithm

    Duan, H. D. / Modelling and Simulation Society of Australia | British Library Conference Proceedings | 1995


    Research on Satellite Selection Algorithm Based on Delaunay Triangulation Projection

    Wang, Ning / Li, Kezhao / Wei, Jinben | British Library Conference Proceedings | 2019