Results 1 
8 of
8
Removing excess topology from isosurfaces
 ACM Trans. Graph
"... Many highresolution surfaces are created through isosurface extraction from volumetric representations, obtained by 3D photography, CT, or MRI. Noise inherent in the acquisition process can lead to geometrical and topological errors. Reducing geometrical errors during reconstruction is well studied ..."
Abstract

Cited by 74 (1 self)
 Add to MetaCart
Many highresolution surfaces are created through isosurface extraction from volumetric representations, obtained by 3D photography, CT, or MRI. Noise inherent in the acquisition process can lead to geometrical and topological errors. Reducing geometrical errors during reconstruction is well studied. However, isosurfaces often contain many topological errors in the form of tiny handles. These nearly invisible artifacts hinder subsequent operations like mesh simplification, remeshing, and parametrization. In this article we present a practical method for removing handles in an isosurface. Our algorithm makes an axisaligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. The algorithm is designed to facilitate outofcore execution. It finds the handles by incrementally constructing and analyzing a Reeb graph. The size of a handle is measured by a short nonseparating cycle. Handles are removed robustly by modifying the volume rather than attempting “mesh surgery. ” Finally, the volumetric modifications are spatially localized to preserve geometrical detail. We demonstrate topology simplification on several complex models, and show its benefits for subsequent surface processing.
Progressive Encoding of Complex Isosurfaces
, 2003
"... Some of the largest and most intricate surfaces result from isosurface extraction of volume data produced by 3D imaging modalities and scientific simulations. Such surfaces often possess both complicated geometry and topology (i.e., many connected components and high genus). Because of their sheer s ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Some of the largest and most intricate surfaces result from isosurface extraction of volume data produced by 3D imaging modalities and scientific simulations. Such surfaces often possess both complicated geometry and topology (i.e., many connected components and high genus). Because of their sheer size, efficient compression algorithms, in particular progressive encodings, are critical in working with these surfaces. Most standard mesh compression algorithms have been designed to deal with generally smooth surfaces of low topologic complexity. Much better results can be achieved with algorithms which are specifically designed for isosurfaces arising from volumetric datasets.
Decreasing Isosurface Complexity Via Discrete Fitting
, 2000
"... Since the introduction of techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of generated triangles (or polygons). This paper presents an algorithm that considerably reduces the number of triangles generated by a Marching Cubes a ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Since the introduction of techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of generated triangles (or polygons). This paper presents an algorithm that considerably reduces the number of triangles generated by a Marching Cubes algorithm, while presenting very close or shorter running times. The algorithm first assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar triangular facets. Lastly, the vertices which survived the decimation process are located on their exact positions and normals are computed. An experimental evaluation of the proposed approach on datasets relevant to biomedical imaging and chemical modeling is reported. 2000 Elsevier Science B.V. All rights reserved. Keywords: Volume rendering; Isosurface extraction; Marching cubes; Surface simplification 1.
Discrete Frontiers
, 2003
"... Many applications require to extract the surface of an object from a discrete set of valued points, applications in which the topological soundness of the obtained surface is, in many case, of the utmost importance. In this paper, we introduce... ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Many applications require to extract the surface of an object from a discrete set of valued points, applications in which the topological soundness of the obtained surface is, in many case, of the utmost importance. In this paper, we introduce...
An Outofcore Algorithm for Isosurface Topology Simplification
"... ... In this paper we present an efficient method for removing handles in an isosurface. Our algorithm makes an axisaligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. The algorithm is designed for outofcore execution. It finds the handles by increm ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
... In this paper we present an efficient method for removing handles in an isosurface. Our algorithm makes an axisaligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. The algorithm is designed for outofcore execution. It finds the handles by incrementally constructing and analyzing a surface Reeb graph. The size of a handle is measured by a short surface loop that breaks it. Handles are removed robustly by modifying the volume rather than attempting "mesh surgery." Finally, the volumetric modifications are spatially localized to preserve geometrical detail. We demonstrate topology simplification on several complex models, and show its benefit for subsequent surface processing
Optimization schemes for the reversible discrete volume polyhedrization using Marching Cubes simplification
, 2006
"... ..."
A linear algorithm for constructing the Polygon Adjacency Relation in Isosurfaces of 3D images
 In Ehoud Ahronovitz and Christophe Fiorio, editors, Discrete Geometry for Computer Imagery
, 1997
"... This paper proposes an optimal algorithm for constructing the surface adjacency relation in a list of polygons extracted from 3D medical images. The discrete nature of data allows us to build this adjacency relation in a time proportional to the number of triangles T . We have payed a special at ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper proposes an optimal algorithm for constructing the surface adjacency relation in a list of polygons extracted from 3D medical images. The discrete nature of data allows us to build this adjacency relation in a time proportional to the number of triangles T . We have payed a special attention on the memory requirements, since our method takes as input the surface extracted by the MarchingCubes algorithm and does not make reference to the initial 3D dataset. Moreover, no additional temporary storage is needed to compute the relation. 1 Introduction Since the development of 3D medical scanning devices, a tremendous number of techniques have been proposed for reconstructing, processing and visualizing the anatomical data. One of the most used approach for understanding the 3D structure of objects consists in extracting isosurfaces from the volume. The geometric description of these data can then be visualized by the help of classical rendering algorithms, using variou...
Supervisor: Sylvie PhilippFoliguet
, 2012
"... Dedico aquest treball a la Lara, sense tu no hagués estat possible. Gràcies per haverme escoltat els rotllos dels watersheds i skeletons, per haverme animat en els moments difícils. També el vull dedicar als meus pares, que sou els qui heu aguantat tants maldecaps, tants anys. Ja s’ha acabat per fi ..."
Abstract
 Add to MetaCart
Dedico aquest treball a la Lara, sense tu no hagués estat possible. Gràcies per haverme escoltat els rotllos dels watersheds i skeletons, per haverme animat en els moments difícils. També el vull dedicar als meus pares, que sou els qui heu aguantat tants maldecaps, tants anys. Ja s’ha acabat per fi la carrera infinita! Je veux remercier Sylvie Phillipp, Michel Jordan, Laurent Najman et Jean Coustypour m’accuellir dans leur équipes. Merci pour m’avoir découvert le monde de la recherche et me permettre participer de trés bonnes discussions. Merci Jean pour consacrer ton temps