Marching Cubes

Marching Cubes is a computational algorithm in the field of scalar field visualization that reconstructs isosurfaces from three-dimensional volumetric data by systematically applying a local surface extraction rule to each cube in a regular grid, thereby transforming discrete scalar values into a continuous polygonal surface representation.

234

Publications

35.1K

Citations

632

Authors

270

Institutions

Publications per year

2017–2026

37

Authors

632

  1. GM
    Gregory M. Nielson

    Arizona State University, United States

    5 publications · 587 citations

    5

    h-index

  2. WE
    William E. Lorensen

    General Electric (United States), United States

    5 publications · 20.9K citations

    5

    h-index

  3. CS
    Claudio Silva

    New York University, United States

    4 publications · 159 citations

    4

    h-index

  4. YO
    Yutaka Ohtake

    The University of Tokyo, Japan

    4 publications · 102 citations

    4

    h-index

  5. CS
    Carlos Scheidegger

    University of Utah, United States

    4 publications · 167 citations

    4

    h-index

1–5 of 632

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 17 publications · 1.1K citations

    14

    h-index

  2. Computer Graphics Forum

    13 publications · 682 citations

    13

    h-index

  3. ACM Transactions on Graphics

    TOG · 6 publications · 444 citations

    6

    h-index

  4. 6

    h-index

  5. The Visual Computer

    5 publications · 289 citations

    5

    h-index

1–5