Results 1  10
of
351
Marching cubes: A high resolution 3D surface construction algorithm
 COMPUTER GRAPHICS
, 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract

Cited by 2696 (4 self)
 Add to MetaCart
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical
Discretized Marching Cubes
 Visualization '94 Proceedings
, 1994
"... Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. This paper presents an algorithm that considerably reduces the number of polygons generated by a Marching ..."
Abstract

Cited by 85 (5 self)
 Add to MetaCart
number of incidences, thus allowing simple merging of the output facets into large coplanar polygons. An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported. 1 Introduction The use of the Marching Cubes (MC) technique, originally
Adaptive Marching Cubes
 THE VISUAL COMPUTER
, 1995
"... The Marching Cubes algorithm (MC) is a powerful surface rendering technique which can produce very high quality images. However, it is not suitable for interactive manipulation of the 3D surfaces constructed from high resolution volume data sets in terms of both space and time. In this paper, we pre ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
The Marching Cubes algorithm (MC) is a powerful surface rendering technique which can produce very high quality images. However, it is not suitable for interactive manipulation of the 3D surfaces constructed from high resolution volume data sets in terms of both space and time. In this paper, we
Exact Isosurfaces for Marching Cubes
 COMPUTER GRAPHICS FORUM
, 2002
"... In this paper we study the exact contours of a piecewise trilinear scalar field. We show how to represent these contours exactly as trimmed surfaces of triangular rational cubic Bézier patches. As part of this, we introduce an extension of the marching cubes algorithm which gives a topologically exa ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we study the exact contours of a piecewise trilinear scalar field. We show how to represent these contours exactly as trimmed surfaces of triangular rational cubic Bézier patches. As part of this, we introduce an extension of the marching cubes algorithm which gives a topologically
Adaptive Extended Marching Cubes
"... Figure1: Pictures of isosurfaces using marching cubes with adaptive resolutions and sharp features. The maximum octree level are 2, 3, 4, 5, 7 from left to right. The demands related to Volumetric Models are increasing rapidly due to the availability of 3D scanner, but its application in the manipul ..."
Abstract
 Add to MetaCart
Figure1: Pictures of isosurfaces using marching cubes with adaptive resolutions and sharp features. The maximum octree level are 2, 3, 4, 5, 7 from left to right. The demands related to Volumetric Models are increasing rapidly due to the availability of 3D scanner, but its application
Abstract Discretized Marching Cubes
"... Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. This paper presents an algorithm that considerably reduces the number of polygons generated by a Marching ..."
Abstract
 Add to MetaCart
Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. This paper presents an algorithm that considerably reduces the number of polygons generated by a Marching
Probabilistic Marching Cubes
"... In this paper we revisit the computation and visualization of equivalents to isocontours in uncertain scalar fields. We model uncertainty by discrete random fields and, in contrast to previous methods, also take arbitrary spatial correlations into account. Starting with joint distributions of the ra ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
of the random variables associated to the sample locations, we compute level crossing probabilities for cells of the sample grid. This corresponds to computing the probabilities that the wellknown symmetryreduced marching cubes cases occur in random field realizations. For Gaussian random fields, only
A survey of the marching cubes algorithm
, 2006
"... A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163–9], a wellknown cellbycell method for extraction of isosurfaces from scalar volumetric data sets, is presented ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163–9], a wellknown cellbycell method for extraction of isosurfaces from scalar volumetric data sets
Marching Cubes: Surface Complexity Measure
, 1999
"... In this work we give an approach to analyse a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this work we give an approach to analyse a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation
– Extended Marching Cubes
"... • Problem: Distance fields (DFs) sampled at finite resolution can not recover sharp features • Consider two related solutions: ..."
Abstract
 Add to MetaCart
• Problem: Distance fields (DFs) sampled at finite resolution can not recover sharp features • Consider two related solutions:
Results 1  10
of
351