Convex Polygon Triangulation

Convex Polygon Triangulation is the decomposition of a convex polygon into a set of non-overlapping triangles by drawing non-intersecting diagonals between its vertices, such that the triangulation covers the entire polygonal area and exploits the polygon’s convexity to ensure that any internal diagonal lies entirely within the polygon.

42

Publications

1.7K

Citations

77

Authors

47

Institutions

Publications per year

2017–2026

1

Authors

77

  1. DE
    David Eppstein

    University of California, Irvine, United States

    4 publications · 84 citations

    4

    h-index

  2. FH
    Ferrán Hurtado

    Universitat Politècnica de Catalunya, Spain

    2 publications · 44 citations

    2

    h-index

  3. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    2 publications · 54 citations

    2

    h-index

  4. MN
    Marc Noy

    Universitat Politècnica de Catalunya, Spain

    2 publications · 117 citations

    2

    h-index

  5. KN
    Koji Nakano

    Hiroshima University, Japan

    2 publications · 30 citations

    2

    h-index

1–5 of 77

Venues

  1. Computational Geometry

    4 publications · 154 citations

    4

    h-index

  2. Information Processing Letters

    2 publications · 319 citations

    2

    h-index

  3. Algorithmica

    1 publications · 42 citations

    2

    h-index

  4. International Journal of Computer Mathematics

    2 publications · 27 citations

    2

    h-index

  5. Journal of Algorithms

    2 publications · 94 citations

    2

    h-index

1–5