Delaunay Triangulation Algorithms

Delaunay Triangulation Algorithms is a computational geometry method that systematically constructs a Delaunay triangulation by ensuring that no input point lies within the circumcircle of any triangle in the resulting mesh, thereby maximizing the minimum angle of all angles in the triangulation.

1.2K

Publications

72.3K

Citations

2.3K

Authors

909

Institutions

Publications per year

2017–2026

174

Authors

2.3K

  1. TK
    Tamal K. Dey

    The Ohio State University, United States

    17 publications · 493 citations

    15

    h-index

  2. OD
    Olivier Devillers

    Institut national de recherche en sciences et technologies du numérique, France

    19 publications · 867 citations

    15

    h-index

  3. JB
    Jean‐Daniel Boissonnat

    Institut national de recherche en sciences et technologies du numérique, France

    20 publications · 953 citations

    15

    h-index

  4. JR
    Jonathan Richard Shewchuk

    University of California, Berkeley, United States

    14 publications · 2.2K citations

    14

    h-index

  5. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    13 publications · 2.4K citations

    13

    h-index

1–5 of 2.3K

Venues

  1. 24

    h-index

  2. Computational Geometry

    36 publications · 2.3K citations

    23

    h-index

  3. ACM Transactions on Graphics

    TOG · 22 publications · 2.6K citations

    19

    h-index

  4. Discrete & Computational Geometry

    23 publications · 2.1K citations

    18

    h-index

  5. 16

    h-index

1–5