Concepedia

Triangulation Complexity

Triangulation Complexity is a computational geometry metric that quantifies the minimum number of triangles required to decompose a given polygon without overlap or gap, distinguishing it from other polygonal decomposition measures by focusing specifically on triangulation efficiency and structural intricacy.

120

Publications

4.6K

Citations

174

Authors

114

Institutions

Publications per year

2017–2026

1

Parents

Publications

120

A theorem on polygon cutting with applications

Bernard Chazelle · 1982 · 268 citations

, , +16

There is a planar graph almost as good as the complete graph

Paul Chew · 1986 · 237 citations

, , +13

Minimum-weight triangulation is NP-hard

Wolfgang Mulzer, Günter Rote · Journal of the ACM · 2008 · 180 citations · Full text

, , +9

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Robert E. Tarjan, Christopher J. Van Wyk · SIAM Journal on Computing · 1988 · 158 citations

, , +13

Triangulation and shape-complexity

Bernard Chazelle, Janet Incerpi · ACM Transactions on Graphics · 1984 · 126 citations · Full text

, , +16

1–5 of 120

Authors

174

  1. DE
    David Eppstein

    University of California, Irvine, United States

    7 publications · 186 citations

    7

    h-index

  2. DA
    Dominique Attali

    GIPSA-Lab, France

    5 publications · 210 citations

    5

    h-index

  3. JB
    Jean‐Daniel Boissonnat

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

    5 publications · 210 citations

    5

    h-index

  4. MB
    Marshall Bern

    Palo Alto Research Center, United States

    5 publications · 145 citations

    5

    h-index

  5. PH
    Pinar Heggernes

    University of Bergen, Norway

    4 publications · 118 citations

    4

    h-index

1–5 of 174

Institutions

114

  1. Princeton University

    Princeton, United States

    8 h-index

    9 publications

    705 citations

  2. Freie Universität Berlin

    Berlin, Germany

    7 h-index

    9 publications

    409 citations

  3. University of Illinois Urbana-Champaign

    Urbana, United States

    7 h-index

    12 publications

    469 citations

  4. Institut national de recherche en sciences et technologies du numérique

    Le Chesnay-Rocquencourt, France

    6 h-index

    6 publications

    292 citations

  5. Palo Alto Research Center

    Palo Alto, United States

    5 h-index

    7 publications

    185 citations

  6. Carleton University

    Ottawa, Canada

    5 h-index

    11 publications

    278 citations

  7. University of California, Irvine

    Irvine, United States

    4 h-index

    4 publications

    96 citations

  8. Graz University of Technology

    Graz, Austria

    4 h-index

    5 publications

    158 citations

1–8 of 114

Venues

  1. Discrete & Computational Geometry

    7 publications · 183 citations

    7

    h-index

  2. 7

    h-index

  3. Computational Geometry

    6 publications · 236 citations

    6

    h-index

  4. SIAM Journal on Computing

    4 publications · 233 citations

    4

    h-index

  5. SIAM Journal on Discrete Mathematics

    3 publications · 107 citations

    3

    h-index

1–5