Triangulations
Triangulations is a geometric graph construction method that partitions a given domain into a set of non-overlapping triangles such that the union of these triangles exactly covers the domain and any two triangles intersect only at shared vertices or edges.
1.5K
Publications
83.4K
Citations
2.1K
Authors
842
Institutions
Publications per year
2017–2026
123
1.5K
Bernardo Cockburn, Suchung Hou, Chi‐Wang Shu · Mathematics of Computation · 1990 · 1.4K citations · Full text
Computing, Computational Engineering, Computational Mechanics +13
Oriol Vinyals, Meire Fortunato, Navdeep Jaitly · Neural Information Processing Systems · 2015 · 1.3K citations
1–5 of 1.5K
2.1K
22
h-index
19
h-index
19
h-index
University of Illinois Urbana-Champaign, United States
14 publications · 1.5K citations
14
h-index
13
h-index
1–5 of 2.1K
842

Centre National de la Recherche Scientifique
Paris, France
26 h-index
63 publications
2.7K citations
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
40 publications
2.9K citations
University of California, Berkeley
Berkeley, United States
21 h-index
36 publications
4.2K citations
Utrecht University
Utrecht, The Netherlands
20 h-index
49 publications
3.2K citations
University of Copenhagen
Copenhagen, Denmark
19 h-index
42 publications
1.9K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
18 h-index
66 publications
3K citations
Technische Universität Berlin
Berlin, Germany
16 h-index
28 publications
3.2K citations

University of Waterloo
Waterloo, Canada
16 h-index
30 publications
1.1K citations
1–8 of 842
42 publications · 1.3K citations
24
h-index
42 publications · 2.3K citations
24
h-index
28 publications · 5K citations
21
h-index
27 publications · 1.6K citations
21
h-index
41 publications · 1.1K citations
20
h-index
1–5