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
234
Marching cubes: A high resolution 3D surface construction algorithm
William E. Lorensen, H. E. Cline · 1987 · 10.2K citations · Full text
Computing, Radiology, Visualization +17
W. J. Schroeder, Jonathan A. Zarge, William E. Lorensen · 1992 · 1.5K citations
Computing, Computer Science, Computational Fluid Dynamics +16
1–5 of 234
632
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 632
270
University of Utah
Salt Lake City, United States
9 h-index
20 publications
791 citations
Arizona State University
Tempe, United States
7 h-index
11 publications
970 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
11 publications
344 citations
The University of Tokyo
Tokyo, Japan
5 h-index
11 publications
356 citations
Stony Brook University
Stony Brook, United States
5 h-index
12 publications
667 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
9 publications
370 citations
The Ohio State University
Columbus, United States
4 h-index
7 publications
442 citations
University of California, Davis
Davis, United States
4 h-index
7 publications
158 citations
1–8 of 270
TVCG · 17 publications · 1.1K citations
14
h-index
13 publications · 682 citations
13
h-index
TOG · 6 publications · 444 citations
6
h-index
6 publications · 255 citations
6
h-index
5 publications · 289 citations
5
h-index
1–5