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
15
Improved incremental randomized Delaunay triangulation
Olivier Devillers · 1998 · 85 citations · Full text
Efficient and good Delaunay meshes from random points
Mohamed S. Ebeida, Scott A. Mitchell, Andrew Davidson et al. · Computer-Aided Design · 2011 · 33 citations
1–5 of 15
28
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 102 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 28
25
FernUniversität in Hagen
Hagen, Germany
2 h-index
2 publications
30 citations
Texas A&M University
College Station, United States
2 h-index
2 publications
54 citations
Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique
Orléans, France
2 h-index
2 publications
102 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
54 citations

Johns Hopkins University
Baltimore, United States
2 h-index
2 publications
54 citations

Lund University
Lund, Sweden
2 h-index
2 publications
30 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
2 publications
45 citations

Johns Hopkins Medicine
Baltimore, United States
1 h-index
1 publications
30 citations
1–8 of 25
JACM · 1 publications · 31 citations
1
h-index
1 publications · 27 citations
1
h-index
1 publications · 30 citations
1
h-index
IJCGA · 1 publications · 13 citations
1
h-index
1 publications · 87 citations
1
h-index
1–5