Marching Triangles
Marching Triangles is a computational geometry algorithm that, as a variant of the marching methods, reconstructs isosurfaces from scalar fields defined over unstructured triangular meshes by systematically applying local configuration rules to each triangle based on vertex scalar values relative to a specified isovalue.
20
Publications
1.2K
Citations
41
Authors
28
Institutions
Publications per year
2017–2026
2
Parents
20
Generating Triangulated Macromolecular Surfaces by Euclidean Distance Transform
Dong Xu, Yang Zhang · PLoS ONE · 2009 · 146 citations · Full text
1994 · 142 citations
Marching triangles: range image fusion for complex object modelling
Adrian Hilton, A.J. Stoddart, J. Illingworth et al. · 2002 · 134 citations
1–5 of 20
41
3
h-index
2
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 58 citations
2
h-index
2
h-index
1–5 of 41
28
University of Utah
Salt Lake City, United States
3 h-index
5 publications
95 citations
Pontifícia Universidade Católica do Rio de Janeiro
Rio de Janeiro, Brazil
2 h-index
3 publications
108 citations

Center for Advanced Studies Research and Development in Sardinia
Pula, Italy
2 h-index
2 publications
287 citations
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brazil
2 h-index
5 publications
66 citations
Centre Inria d'Université Côte d'Azur
Valbonne, France
2 h-index
2 publications
58 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
58 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
58 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
1 h-index
1 publications
213 citations
1–8 of 28
2 publications · 133 citations
2
h-index
SIGSAM · 2 publications · 58 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 41 citations
1
h-index
1 publications · 15 citations
1
h-index
1–5