Results 11  20
of
825
Efficient implementation of Marching Cubes' cases with topological guarantees
 Journal of Graphics Tools
, 2003
"... Marching Cubes' methods first offered visual access to experimental and theoretical data. The implementation of this method usually relies on a small lookup table. Many enhancements and optimizations of Marching Cubes still use it. However, this lookup table can lead to cracks and inconsistent ..."
Abstract

Cited by 66 (5 self)
 Add to MetaCart
Marching Cubes' methods first offered visual access to experimental and theoretical data. The implementation of this method usually relies on a small lookup table. Many enhancements and optimizations of Marching Cubes still use it. However, this lookup table can lead to cracks and inconsistent
OctreeBased Decimation of Marching Cubes Surfaces
, 1996
"... The Marching Cubes (MC) algorithm is a commonly used method for generating isosurfaces. The MC algorithm also generates an excessively large number of triangles to represent an isosurface. Generating many triangles increases the rendering time which is directly proportional to the number of triangle ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
The Marching Cubes (MC) algorithm is a commonly used method for generating isosurfaces. The MC algorithm also generates an excessively large number of triangles to represent an isosurface. Generating many triangles increases the rendering time which is directly proportional to the number
Dual/Primal Mesh Optimization
"... A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a be ..."
Abstract
 Add to MetaCart
better approximation of the implicit surface than the standard marching cubes mesh [11] (in our experiments we use VTK marching cubes [16]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
, 2002
"... A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a be ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
better approximation of the implicit surface than the standard marching cubes mesh [11] (in our experiments we use VTK marching cubes [16]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices
DualPrimal Mesh Optimization for Polygonized Implicit
"... A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a be ..."
Abstract
 Add to MetaCart
better approximation of the implicit surface than the standard Marching Cubes mesh [12] (in our experiments we use VTK Marching Cubes [18]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices
EXACT VISUAL HULL FROM MARCHING CUBES
"... Abstract: The marching cubes algorithm has been widely adopted for extracting a surface mesh from a volumetric description of the visual hull reconstructed from silhouettes. However, typical volumetric descriptions, such as an octree, provide only a binary description about the visual hull. The lack ..."
Abstract
 Add to MetaCart
Abstract: The marching cubes algorithm has been widely adopted for extracting a surface mesh from a volumetric description of the visual hull reconstructed from silhouettes. However, typical volumetric descriptions, such as an octree, provide only a binary description about the visual hull
SemiRegular Mesh Extraction from Volumes
, 2000
"... We present a novel method to extract isosurfaces from distance volumes. It generates high quality semiregular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multiscale f ..."
Abstract

Cited by 104 (13 self)
 Add to MetaCart
and connected while respecting the topology of the isosurface implied by the data. Subsequent multiscale refinement is driven by a simple forcebased solver designed to combine good isosurface fit and high quality sampling through reparameterization. In contrast to the Marching Cubes technique our output
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
Adaptively adjusting Marching Cubes output to fit a trilinear reconstruction filter
, 1997
"... . The paper focuses on the improvement of the quality of isosurfaces #tted on volume datasets with respect to standard MC solutions. The new solution presented improves the precision in the reconstruction process using an approach based on mesh re#nement and driven by the evaluation of the trilinear ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
and processing times. 1 Introduction The Marching Cubes #MC# algorithm #11# is nowadays the most diffuse technique for the extraction of isosurfaces out of volume datasets. The reasons for the MC success include its simple logical structure, implying a nearly straightforward implementation, and its
Converting CSG models into Meshed BRep Abstract Models Using Euler Operators and Propagation Based Marching Cubes
"... The purpose of this work is to define a new algorithm for converting a CSG representation into a BRep representation. Usually this conversion is done determining the union, intersection or difference from two BRep represented solids. Due to the lack of explicit representation of surface boundarie ..."
Abstract
 Add to MetaCart
it is a set membership classification problem with respect to the CSG object for all sampling points in a volume space. Marching cubes algorithms create a simple mesh that is enough for visualization purposes. However, when engineering processes are involved, a solid model is necessary. A solid ensures
Results 11  20
of
825