Triangulation Data Structures

Triangulation Data Structures is a spatial data structure that organizes geometric points into a simplicial complex of triangles, distinguished by its explicit encoding of topological relationships among vertices, edges, and faces to support efficient spatial queries and geometric computations.

73

Publications

4.4K

Citations

140

Authors

75

Institutions

Publications per year

2017–2026

5

Authors

140

  1. LD
    Leila De Floriani

    University of Genoa, Italy

    3 publications · 227 citations

    3

    h-index

  2. OD
    Olivier Devillers

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

    3 publications · 98 citations

    3

    h-index

  3. RP
    Renato Pajarola

    University of Zurich, Switzerland

    3 publications · 92 citations

    3

    h-index

  4. BC
    Bernard Chazelle

    Princeton University, United States

    3 publications · 869 citations

    3

    h-index

  5. CD
    Christopher DeCoro

    Princeton University, United States

    2 publications · 74 citations

    2

    h-index

1–5 of 140

Venues

  1. Computer-Aided Design

    4 publications · 195 citations

    4

    h-index

  2. Computational Geometry

    4 publications · 60 citations

    4

    h-index

  3. IEEE Computer Graphics and Applications

    3 publications · 343 citations

    3

    h-index

  4. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 2 publications · 235 citations

    2

    h-index

  5. Algorithmica

    2 publications · 137 citations

    2

    h-index

1–5