Constrained Triangulation

Constrained Triangulation is a computational geometry method that produces a triangulation of a given polygonal domain while preserving specified edges or boundaries as part of the resulting triangulated mesh.

112

Publications

4.3K

Citations

249

Authors

120

Institutions

Publications per year

2017–2026

14

Authors

249

  1. JR
    Jonathan Richard Shewchuk

    University of California, Berkeley, United States

    4 publications · 293 citations

    4

    h-index

  2. TA
    Tinghua Ai

    Wuhan University, China

    3 publications · 48 citations

    3

    h-index

  3. MM
    Martijn Meijers

    Delft University of Technology, Netherlands

    3 publications · 152 citations

    3

    h-index

  4. SA
    Scott A. McElfresh

    Middlebury College, United States

    2 publications · 34 citations

    2

    h-index

  5. HL
    Hugo Ledoux

    Delft University of Technology, Netherlands

    2 publications · 134 citations

    2

    h-index

1–5 of 249

Venues

  1. 7

    h-index

  2. Transactions in GIS

    4 publications · 68 citations

    4

    h-index

  3. 4

    h-index

  4. Computational Geometry

    3 publications · 63 citations

    3

    h-index

  5. Discrete & Computational Geometry

    3 publications · 336 citations

    3

    h-index

1–5