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

Authors

41

  1. CS
    Claudio Silva

    New York University, United States

    3 publications · 82 citations

    3

    h-index

  2. RS
    Riccardo Scateni

    University of Cagliari, Italy

    2 publications · 287 citations

    2

    h-index

  3. LC
    Lis Custódio

    Pontifícia Universidade Católica do Rio de Janeiro, Brazil

    2 publications · 67 citations

    2

    h-index

  4. MT
    Monique Teillaud

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

    2 publications · 58 citations

    2

    h-index

  5. CS
    Carlos Scheidegger

    University of Utah, United States

    2 publications · 27 citations

    2

    h-index

1–5 of 41

Venues

  1. Computer Graphics Forum

    2 publications · 133 citations

    2

    h-index

  2. ACM communications in computer algebra

    SIGSAM · 2 publications · 58 citations

    2

    h-index

  3. Computer Vision Graphics and Image Processing

    1 publications · 30 citations

    1

    h-index

  4. Computers & Graphics

    1 publications · 41 citations

    1

    h-index

  5. Computing in Science & Engineering

    1 publications · 15 citations

    1

    h-index

1–5