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

Authors

58

  1. OD
    Olivier Devillers

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

    3 publications · 150 citations

    3

    h-index

  2. KL
    Kenneth L. Clarkson

    AT&T (United States), United States

    2 publications · 87 citations

    2

    h-index

  3. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 87 citations

    2

    h-index

  4. RK
    Rolf Klein

    University of Bonn, Germany

    2 publications · 30 citations

    2

    h-index

  5. EA
    Edgar A. Ramos

    University of Illinois Urbana-Champaign, United States

    2 publications · 54 citations

    2

    h-index

1–5 of 58

Venues

  1. Discrete & Computational Geometry

    4 publications · 147 citations

    4

    h-index

  2. 3

    h-index

  3. Computer Aided Geometric Design

    1 publications · 52 citations

    1

    h-index

  4. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 1 publications · 17 citations

    1

    h-index

  5. Computer-Aided Design

    1 publications · 33 citations

    1

    h-index

1–5