Triangulation Algorithms

Triangulation Algorithms is a computational method in the field of geographic information science that systematically partitions a set of irregularly distributed points into a contiguous network of non-overlapping triangles to optimize surface representation and geometric accuracy.

1.2K

Publications

70.1K

Citations

2.1K

Authors

769

Institutions

Publications per year

2017–2026

101

Authors

2.1K

  1. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    15 publications · 3K citations

    15

    h-index

  2. OD
    Olivier Devillers

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

    20 publications · 958 citations

    15

    h-index

  3. DE
    David Eppstein

    University of California, Irvine, United States

    16 publications · 876 citations

    14

    h-index

  4. JS
    Jack Snoeyink

    University of North Carolina at Chapel Hill, United States

    17 publications · 731 citations

    13

    h-index

  5. PB
    Prosenjit Bose

    Carleton University, Canada

    11 publications · 427 citations

    11

    h-index

1–5 of 2.1K

Venues

  1. Computational Geometry

    49 publications · 2.1K citations

    26

    h-index

  2. ACM Transactions on Graphics

    TOG · 30 publications · 2.4K citations

    23

    h-index

  3. Discrete & Computational Geometry

    30 publications · 2.3K citations

    22

    h-index

  4. Computer-Aided Design

    22 publications · 1.2K citations

    19

    h-index

  5. 17

    h-index

1–5