Randomized Delaunay Triangulation

Randomized Delaunay Triangulation is a randomized geometric algorithm that constructs a Delaunay triangulation by incrementally inserting points in random order, leveraging probabilistic analysis to achieve expected optimal time complexity.

15

Publications

520

Citations

28

Authors

25

Institutions

Publications per year

2017–2026

0

Authors

28

  1. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    2 publications · 54 citations

    2

    h-index

  2. OD
    Olivier Devillers

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

    2 publications · 102 citations

    2

    h-index

  3. NM
    Nancy M. Amato

    Texas A&M University, United States

    2 publications · 54 citations

    2

    h-index

  4. AL
    Andrzej Lingas

    Lund University, Sweden

    2 publications · 30 citations

    2

    h-index

  5. RK
    Rolf Klein

    University of Bonn, Germany

    2 publications · 30 citations

    2

    h-index

1–5 of 28

Venues

  1. Journal of the ACM

    JACM · 1 publications · 31 citations

    1

    h-index

  2. Computational Geometry

    1 publications · 27 citations

    1

    h-index

  3. Discrete & Computational Geometry

    1 publications · 30 citations

    1

    h-index

  4. 1

    h-index

  5. Theoretical Computer Science

    1 publications · 87 citations

    1

    h-index

1–5