Filters








1,191 Hits in 9.8 sec

Implicit vessel surface reconstruction for visualization and CFD simulation

Christian Schumann, Mathias Neugebauer, Ragnar Bade, Bernhard Preim, Heinz-Otto Peitgen
2008 International Journal of Computer Assisted Radiology and Surgery  
Moreover, the triangle quality of the generated surfaces is suitable for CFD simulations.  ...  To guarantee a high triangle quality, the surface is remeshed. Results: Compared to other methods, our approach represents a good trade-off between accuracy and smoothness.  ...  Thanks to Claudio Silva from the University of Utah for access to the AFront software.  ... 
doi:10.1007/s11548-007-0137-x fatcat:s54evopteffbnpo5mbndwkpuuu

Adaptive surface extraction from anisotropic volumetric data: contouring on generalized octrees

Ricardo Uribe Lobello, Florence Denis, Florent Dupont
2013 Annales des télécommunications  
This surface must fit to the geometrical and topological features of the object in order to obtain a good approximation and to avoid topological artefacts.  ...  In this article, we present an algorithm to extract adaptive surfaces from anisotropic volumetric data.  ...  Acknowledgements The authors would like to thank the Stanford 3D Scanning Repository and Georgia Tech Large Geometric Models Archive for the models used in this article.  ... 
doi:10.1007/s12243-013-0369-4 fatcat:owwifw6sffhypkha5i57z4hdme

Edge Transformations for Improving Mesh Quality of Marching Cubes

C.A. Dietrich, C.E. Scheidegger, J. Schreiner, J.L.D. Comba, L.P. Nedel, C.T. Silva
2009 IEEE Transactions on Visualization and Computer Graphics  
In our experiments, our method did not create a single degenerate triangle, unlike any other method we experimented with.  ...  Most importantly, it can be readily integrated in existing Marching Cubes implementations and is orthogonal to many Marching Cubes enhancements (particularly, performance enhancements such as out-of-core  ...  STUDYING THE MESH QUALITY OF MARCHING CUBES In this section, we show that MC generates bad triangles only in some particular configurations.  ... 
doi:10.1109/tvcg.2008.60 pmid:19008562 fatcat:faoyefu3ujhjfltx5be6yioppi

Crease Surfaces: From Theory to Extraction and Application to Diffusion Tensor MRI

T. Schultz, H. Theisel, H.-P. Seidel
2010 IEEE Transactions on Visualization and Computer Graphics  
Second, crease surfaces are not in general orientable.  ...  Unlike isosurfaces, they are able to capture extremal structures in the data.  ...  In marching cubes with PCA, it is slightly less than 1%; in our proposed method, such configurations do not occur by design.  ... 
doi:10.1109/tvcg.2009.44 pmid:19910665 fatcat:efy3iju2tjci7onmo3m3ul3h4q

Direct Contouring of Implicit Closest Point Surfaces [article]

Stefan Auer, Rüdiger Westermann
2013 Eurographics State of the Art Reports  
In combination with a new table-based triangulation scheme this allows us to detect and preserve sharp features, and to avoid small degenerated triangles in smooth areas.  ...  models: Since we select the vertex positions directly from the set of closest points, all triangle vertices are guaranteed to lie exactly on the zero-contour and no approximations are necessary.  ...  It is just as simple to implement, yet it uses exact vertex positions which are not restricted to the grid edges and it avoids the generation of degenerated triangles, resulting in 18% less triangles in  ... 
doi:10.2312/conf/eg2013/short/001-004 fatcat:4dffwurnxvbavgg3srzmruzsre

Convex contouring of volumetric data

Tao Ju, Scott Schaefer, Joe Warren
2003 The Visual Computer  
Unlike Marching Cubes or other cell-based algorithms, the proposed polygonization generates convex negative space inside individual cells, enabling fast collision detection on the triangulated isosurface  ...  In our implementation, we are able to perform over 2 million point classifications per second.  ...  Notice that convex contouring generates on average only about 2% more triangles than the Marching Cubes algorithm.  ... 
doi:10.1007/s00371-003-0216-0 fatcat:ocwagabblnfmlm5m3jghnn67ua

Surface Reconstruction: An Improved Marching Triangle Algorithm for Scalar and Vector Implicit Field Representations

Marc Fournier
2009 2009 XXII Brazilian Symposium on Computer Graphics and Image Processing  
In this paper we propose a new polygonization method based on the classic Marching Triangle algorithm.  ...  We use relevant error metric tools to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process  ...  Visually in Figure 10 we also see that Marching Triangle colormap contains less red color errors compared to Marching Cube colormap.  ... 
doi:10.1109/sibgrapi.2009.14 dblp:conf/sibgrapi/Fournier09 fatcat:lznabv54h5bxfngr3wpe6jabcu

Marching Triangle Polygonization for Efficient Surface Reconstruction from Its Distance Transform [chapter]

Marc Fournier, Jean-Michel Dischler, Dominique Bechmann
2009 Lecture Notes in Computer Science  
We use a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process  ...  In this paper we propose a new polygonization method based on the classic Marching Triangle algorithm.  ...  This improvement contributes to obtain more equilateral triangles which are less deformed and which sizes adapt gradually to local geometry curvature. Fig. 2.  ... 
doi:10.1007/978-3-642-04397-0_15 fatcat:3w6k3ntffnbcpd4ws5kkhqxjdq

On Volumetric Shape Reconstruction from Implicit Forms [chapter]

Li Wang, Franck Hétroy-Wheeler, Edmond Boyer
2016 Lecture Notes in Computer Science  
In order to compare the existing strategies, we present an extensive evaluation that analyzes various properties of the main strategies for implicit to explicit volumetric conversions: Marching cubes,  ...  Many visual applications build implicit representations of shapes that are converted into explicit shape representations using geometric tools such as the Marching Cubes algorithm.  ...  to Marching Cubes.  ... 
doi:10.1007/978-3-319-46487-9_11 fatcat:yt5nphml55dmbae67luxw7dyeu

Feature sensitive surface extraction from volume data

Leif P. Kobbelt, Mario Botsch, Ulrich Schwanecke, Hans-Peter Seidel
2001 Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01  
Marching Cubes algorithm.  ...  Center right shows the result of our new extended Marching Cubes algorithm applied to the original volume data, and finally on the far right we show the reconstruction by our new algorithm applied to the  ...  If the cell does not contain a sharp feature, we generate a local triangle mesh patch by using the standard Marching Cubes table.  ... 
doi:10.1145/383259.383265 dblp:conf/siggraph/KobbeltBSS01 fatcat:g72cponeu5hinmgpusd5rm63pm

Three-dimensional digital approximations of grain boundary networks in polycrystals

S-B Lee, G S Rohrer, A D Rollett
2014 Modelling and Simulation in Materials Science and Engineering  
Simulated microstructures are used to verify that the resulting mesh qualitatively and quantitatively approximates the true structure, in terms of the displacement of the nodes, the grain volume change  ...  In this work, we offer a set of algorithms that convert a voxellated image to a conformal surface mesh that is targeted for polycrystalline materials containing grains with a wide range of sizes and complex  ...  one local marching cube out of 256 (=2 8 ) possible different configurations.  ... 
doi:10.1088/0965-0393/22/2/025017 fatcat:sasffkluk5bc7dinxjvnnbrcxm

A new vector field distance transform and its application to mesh processing from 3D scanned data

Marc Fournier, Jean-Michel Dischler, Dominique Bechmann
2007 The Visual Computer  
Widely used Marching Cube triangulation algorithm is adapted to the new vector field distance transform to correctly reconstruct the resulting explicit surface.  ...  In this paper we define a new 3D vector field distance transform to implicitly represent a mesh surface.  ...  Acknowledgment We wish to thank the following sources for the use of the models included in this paper:  ... 
doi:10.1007/s00371-007-0143-6 fatcat:gtsjusdztfcujjddxlmaoi7rwa

Deforming meshes that split and merge

Chris Wojtan, Nils Thürey, Markus Gross, Greg Turk
2009 ACM Transactions on Graphics  
Figure 1: Dropping viscoelastic balls in an Eulerian fluid simulation.  ...  Acknowledgments We would like to thank Joe Schmid for the particle level set implementation and Andrew Selle for help with getting it to work properly.  ...  We also would like to thank Tobias Pfaff for assembling our video.  ... 
doi:10.1145/1531326.1531382 fatcat:lngilnpr6jauda2erussqycm3q

Deforming meshes that split and merge

Chris Wojtan, Nils Thürey, Markus Gross, Greg Turk
2009 ACM SIGGRAPH 2009 papers on - SIGGRAPH '09  
Figure 1: Dropping viscoelastic balls in an Eulerian fluid simulation.  ...  Acknowledgments We would like to thank Joe Schmid for the particle level set implementation and Andrew Selle for help with getting it to work properly.  ...  We also would like to thank Tobias Pfaff for assembling our video.  ... 
doi:10.1145/1576246.1531382 fatcat:zrhmly6ydzeofkijw2qzshswhi

Adaptive surface data compression

Erwin Keeve, Stefan Schaller, Sabine Girod, Bernd Girod
1997 Signal Processing  
Computer generated 3D reconstructions of the human skull are used to build stereolithographic models, which can be used to simulate surgery or to create individual implants.  ...  We have improved an adaptive compression algorithm that significantly reduces the number of triangles required to model complex objects without losing visible detail and have implemented it in our surgery  ...  However, because we are using only triangle meshes generated by the "Marching-Cubes" algorithm or directly reconstructed from Cyberware scanner data, attention must be given to only two special cases during  ... 
doi:10.1016/s0165-1684(97)00047-9 fatcat:cme6lzdo3neftiwelntzmd54ve
« Previous Showing results 1 — 15 out of 1,191 results