Randomized Triangulation Algorithms
Randomized Triangulation Algorithms is a class of computational geometry algorithms that employ randomization techniques to decompose a polygon into a set of non-overlapping triangles, distinguishing itself by using probabilistic choices during the triangulation process to achieve expected efficiency or simplicity in handling complex polygonal structures.
28
Publications
1.9K
Citations
58
Authors
36
Institutions
Publications per year
2017–2026
1
Parents
28
Online Routing in Triangulations
Prosenjit Bose, Pat Morin · SIAM Journal on Computing · 2004 · 161 citations
Improved incremental randomized Delaunay triangulation
Olivier Devillers · 1998 · 85 citations · Full text
1–5 of 28
58
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 150 citations
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 58
36

Lund University
Lund, Sweden
2 h-index
2 publications
30 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
Freie Universität Berlin
Berlin, Germany
2 h-index
2 publications
57 citations
ETH Zurich
Zurich, Switzerland
2 h-index
3 publications
101 citations
Max Planck Society
Munich, Germany
2 h-index
5 publications
158 citations

Carleton University
Ottawa, Canada
2 h-index
4 publications
370 citations
Texas A&M University
College Station, United States
2 h-index
2 publications
54 citations
AT&T (United States)
Bedminster, United States
2 h-index
5 publications
241 citations
1–8 of 36
4 publications · 147 citations
4
h-index
IJCGA · 3 publications · 100 citations
3
h-index
1 publications · 52 citations
1
h-index
Repository · 1 publications · 17 citations
1
h-index
1 publications · 33 citations
1
h-index
1–5