Marching cubes is a computer graphics algorithm, published in the 1987 SIGGRAPH proceedings by Lorensen and Cline, for extracting a polygonal mesh of an...

the generation of isobars for weather maps. Marching squares takes a similar approach to the 3D marching cubes algorithm: Process each cell in the grid independently...

to marching cubes in order to resolve the possibility of ambiguity in it. The marching tetrahedra algorithm was developed as an extension to marching cubes...

problem of the marching cubes algorithm with some cube configurations. It was originally introduced in 1991. While the original marching cubes algorithm was...

Cubes. Rubik's Cubes continued to be marketed and sold throughout the 1980s and 1990s, but it was not until the early 2000s that interest in the Cube...

sphere-assisted ray marching, the use of cubes and taxicab distance can be used to render voxel volumes. In volumetric ray marching, each ray is traced...

from a given scalar field. It was proposed as an improvement to the marching cubes algorithm, which can produce some "bad" topology, but can also be considered...

the sugar cubes: directly dissolving the cubes in the drink or placing the cube into the mouth while drinking. The typical size for each cube is between...

typical GPU hardware requires conversion to polygon meshes, e.g. by the marching cubes algorithm. Signed distance function Function representation Parallel...

the 3D region of consideration into cubes and determines the intersections of the surface with the edges of the cubes in order to get polygons on the surface...