Triangulation Enumeration

Triangulation Enumeration is the systematic computational process of generating and cataloging all distinct triangulations of a given polygon, distinguished from related enumeration methods by its focus on exhaustively listing every non-isomorphic decomposition into triangles via non-intersecting diagonals.

49

Publications

1.6K

Citations

81

Authors

58

Institutions

Publications per year

2017–2026

3

Authors

81

  1. RS
    Raimund Seidel

    University of California, Berkeley, United States

    4 publications · 61 citations

    4

    h-index

  2. FH
    Frank H. Lutz

    Technische Universität Berlin, Germany

    3 publications · 78 citations

    3

    h-index

  3. JA
    Jesús A. De Loera

    University of California, Davis, United States

    3 publications · 75 citations

    3

    h-index

  4. VÁ
    Víctor Álvarez

    Saarland University, Germany

    2 publications · 35 citations

    2

    h-index

  5. JS
    Jack Snoeyink

    University of North Carolina at Chapel Hill, United States

    2 publications · 34 citations

    2

    h-index

1–5 of 81

Venues

  1. Journal of Combinatorial Theory Series A

    4 publications · 149 citations

    4

    h-index

  2. Canadian Journal of Mathematics

    3 publications · 72 citations

    3

    h-index

  3. The Electronic Journal of Combinatorics

    3 publications · 126 citations

    3

    h-index

  4. ArXiv.org

    Repository · 3 publications · 53 citations

    3

    h-index

  5. Discrete Mathematics

    2 publications · 72 citations

    2

    h-index

1–5