Results 1  10
of
2,944
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
FLOW REDUCTION MARCHING CUBES ALGORITHM
"... Abstract The article focuses on modification of traditional Marching cubes algorithm for medical applications. Main disadvantage of the traditional algorithm is size of models. A reduction process has been added to the MC to produce much smaller models. The reduction process is applied during the MC ..."
Abstract
 Add to MetaCart
Abstract The article focuses on modification of traditional Marching cubes algorithm for medical applications. Main disadvantage of the traditional algorithm is size of models. A reduction process has been added to the MC to produce much smaller models. The reduction process is applied during
Piecewise Linear Hypersurfaces using the Marching Cubes Algorithm
, 1999
"... Surface visualization is very important within scientic visualization. The surfaces depict a value of equal density (an isosurface) or display the surrounds of specied objects within the data. Likewise, in two dimensions contour plots may be used to display the information. Thus similarly, in four d ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
by a tetrahedron, which is also known as a 3simplex. Thus, a continuous n dimensional surface may be represented by a lattice of connected n1 dimensional simplices. This lattice of connected simplices may be calculated over a set of adjacent n dimensional cubes, via for example the Marching Cubes
A novel and efficient implementation of the marching cubes algorithm
, 2001
"... In this paper, a novel and efficient implementation of the marching cubes (MC) algorithm is presented for the reconstruction of anatomical structures from real threedimensional medical data. The proposed approach is based on a generic rule, able to triangulate all 15 standard cube configurations us ..."
Abstract
 Add to MetaCart
In this paper, a novel and efficient implementation of the marching cubes (MC) algorithm is presented for the reconstruction of anatomical structures from real threedimensional medical data. The proposed approach is based on a generic rule, able to triangulate all 15 standard cube configurations
A generalized marching cubes algorithm based on nonbinary classifications
, 1997
"... We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the wellknown marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the wellknown marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below
COMPARISON OF VARIATIONS IN THE MARCHING CUBES ALGORITHM FOR CORTICAL SURFACE RECONSTRUCTIONS
"... Cortical surface reconstructions are increasingly being used to study the anatomy and functional processing of the brain and to make comparisons across individuals. Although the geometry of the surface of the brain varies across individuals, its topology is always equivalent to a twosphere with an ..."
Abstract
 Add to MetaCart
sphere with an Euler Characteristic(χ) of 2. Many different algorithms exist for
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
EECS600 Nakamura, K., Manual Registration of Rendered MRI by Marching Cube Algorithm 1 3D Computer Graphics for Simulations
, 2003
"... ..."
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 548 (1 self)
 Add to MetaCart
to materializing the data cube. In this paper, we investigate the issue of which cells (views) to materialize when it is too expensive to materialize all views. A lattice framework is used to express dependencies among views. We present greedy algorithms that work off this lattice and determine a good set of views
Results 1  10
of
2,944