Filters








1,441 Hits in 7.0 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  
A signed distance field is generated using Multilevel Partition of Unity Implicits and subsequently polygonized using a surface tracking approach.  ...  We propose a method that produces an accurate reconstruction of the vessel surface with satisfactory surface quality.  ...  The simulation results have been generated by Dominique Thévenin, Gábor Janiga and Santhosh Seshadhri from the Laboratory of Fluid Dynamics and Technical Flows of the University of Magdeburg.  ... 
doi:10.1007/s11548-007-0137-x fatcat:s54evopteffbnpo5mbndwkpuuu

Adaptive Implicit Surface Polygonization Using Marching Triangles

Samir Akkouche, Eric Galin
2001 Computer graphics forum (Print)  
We present several modifications to adapt the size of the triangles to the curvature of the surface.  ...  This paper presents several improvements to the marching triangles algorithm for general implicit surfaces.  ...  Thus, visualizing implicit surfaces typically consists in finding the zero-set of f , which may be performed either by polygonizing the surface or by direct ray-tracing.  ... 
doi:10.1111/1467-8659.00479 fatcat:43did6u4n5farblqt2vd6zujbe

Implicit Surface Reconstruction and uniform Sampling by Striped Marching Triangles [article]

Víctor Leborán, Xose M. Pardo
2003 Eurographics State of the Art Reports  
Implicit surfaces provide a solution to this problem. They define a smooth surface surrounding objects which must be polygonized for an efficient visualization.  ...  This work presents a modified method of implicit surface polygonization based on "Marching Triangles".  ...  This research was supported by CICYT TIC 200-0399-C02-02 and Xunta de Galicia PGIDT01TIC20601PN grants.  ... 
doi:10.2312/egs.20031061 fatcat:7y6luctag5frhju63qdoue6cxa

Smooth Signed Distance Surface Reconstruction and Applications [chapter]

Gabriel Taubin
2012 Lecture Notes in Computer Science  
, and produces high quality crack-free adaptive manifold polygon meshes.  ...  In our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface.  ...  produces high quality crack-free adaptive manifold polygon meshes, as shown in Figure 5 .  ... 
doi:10.1007/978-3-642-33275-3_4 fatcat:o5u5kebw7vg6pawma4ow2lvzlm

A Haptic System for Drilling into Volume Data with Polygonal Tools [article]

Yu Liu, Stephen D. Laycock
2009 Computer Graphics and Visual Computing  
By considering the locations of the data points, that are modified when drilling, a relatively small number of voxels are determined each frame which must be recomputed by a Marching Cubes algorithm.  ...  This paper presents a haptic system for using arbitrary polygonal tools for drilling into volume data.  ...  This simulator employs an adaptive octree data structure for the tooth modelling and an oriented bounding box for the cutting tool construction.  ... 
doi:10.2312/localchapterevents/tpcg/tpcg09/009-016 dblp:conf/tpcg/LiuL09 fatcat:ui4z3d7mjrf2dpsgtdlju2gtey

A Calligraphic Interface for Interactive Free-Form Modeling with Large Datasets

B. Rodrigues De Araujo, J.A.P. Jorge
2005 XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)  
Objects may be edited by either by boundary oversketching, or by cutting, relief drawing on surfaces, merging and cloning.  ...  Our work uses the Multi-level Partition of Unity Implicits (MPU) technique to convert point clouds into implicit surfaces.  ...  Even though implicit surfaces provide many advantages over polygonal meshes, they require slow methods such as ray-tracing or polygonization to compute a visual representation.  ... 
doi:10.1109/sibgrapi.2005.2 dblp:conf/sibgrapi/AraujoJ05 fatcat:rmwsikjgrbchhprik53zat3fme

The HybridTree: Mixing skeletal implicit surfaces, triangle meshes, and point sets in a free-form modeling system

Rémi Allègre, Eric Galin, Raphaëlle Chaine, Samir Akkouche
2006 Graphical Models  
Editing operations are performed by exploiting the complementary abilities of implicit and polygonal mesh surface representations in a complete transparent way for the user.  ...  Implicit surfaces are powerful for combining shapes with Boolean and blending operations, while triangle meshes are well-suited for local deformations such as FFD and fast visualization.  ...  project (ACI Masses de données) and is supported by the Ministère de l'Éducation Nationale, de la Recherche et de la Technologie (MENRT) and by the Centre National de la Recherche Scientifique (CNRS).  ... 
doi:10.1016/j.gmod.2005.09.001 fatcat:vtf47k64crafdhbopmwcuzwenm

Polygonization of Implicit Surfaces on Multi-Core Architectures with SIMD Instructions [article]

Pourya Shirazian, Brian Wyvill, Jean-Luc Duprat
2012 Eurographics Symposium on Parallel Graphics and Visualization  
Our solution delivers interactive visualization for modeling systems based on BlobTree scene graph.  ...  We propose a fast, scalable, parallel polygonization algorithm for BlobTrees that takes advantage of multicore processors and SIMD optimization techniques available on modern architectures.  ...  An adaptive parallel polygonization method is proposed by Yang et al. [YCP10] .  ... 
doi:10.2312/egpgv/egpgv12/089-098 fatcat:tdzfppatgvcjthasqbdknpgvpq

Geometric modeling of complex anatomical structures based on implicit functions

Miller Gomez-Mora
2018 Contemporary Engineerng Sciences  
In the reconstruction process, regions composing the anatomical structure are reconstructed from segmented medical images using an implicit surface reconstruction approach, and the set of obtained implicit  ...  Then, a meshing process generates quality surface (triangular) meshes and volumetric (tetrahedral) meshes from the VIF structure.  ...  This work has been partially supported by the Distrital University of Bogotá Francisco José de Caldas under research project cod. 3307857717.  ... 
doi:10.12988/ces.2018.85214 fatcat:cxsidr2grnb2voawznd2npfw5i

Visualization of Anatomic Tree Structures with Convolution Surfaces [article]

S. Oeltze, B. Preim
2004 EUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualization  
In contrast to other authors we employ implicit surfaces to achieve high quality visualization. The method has been applied to a large variety of anatomic trees and produces good results.  ...  The time to construct a geometric model is reduced by means of different bounding volumes and careful choice of parameters for polygonization.  ...  We also want to acknowledge the substantial comments provided by the anonymous reviewers.  ... 
doi:10.2312/vissym/vissym04/311-320 fatcat:zufgbvrepvetzmua3mckdvfrqa

ShapeShop: Free-Form 3D Design with Implicit Solid Modeling [chapter]

Ryan Schmidt, Brian Wyvill
2011 Sketch-based Interfaces and Modeling  
Our system, called ShapeShop, has been used as a testbed to investigate a range of problems, from real-time visualization [36], sweep surfaces [35], surface parameterization [38], and implicit surface  ...  Recent advances have alleviated some of the major technical problems, such as visualization speed and surface control.  ...  Perhaps the simplest technique for visualizing implicit surfaces is polygonization.  ... 
doi:10.1007/978-1-84882-812-4_11 fatcat:7rhclwcxcbdvhh6ofwfam6kena

Optimized surface discretization of functionally defined multi-material objects

Pierre-Alain Fayolle, Alexander Pasko
2012 Advances in Engineering Software  
We present in this paper an algorithm for meshing implicit surfaces based on the Delaunay triangulation of a point-set adaptively sampled on an implicit surface.  ...  Then, we extend this algorithm in order to handle functionally defined heterogeneous object surfaces, while maintaining a good quality for the triangles' shapes and the mesh features (geometrical sharp  ...  Adaptive polygonization of implicit surfaces In this section, we describe our polygonization algorithm based on the Delaunay triangulation of a set of points adaptively sampled on an implicit surface (  ... 
doi:10.1016/j.advengsoft.2011.10.007 fatcat:h4kbon7kgjadxaasi2xed3haui

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  
The far left image shows the standard Marching Cubes reconstruction, center left is the reconstruction by the same algorithm but applied to the enhanced distance field with the same resolution.  ...  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  ...  The right image shows the pieces that are generated in the interior of the cube by the three cuts.  ... 
doi:10.1145/383259.383265 dblp:conf/siggraph/KobbeltBSS01 fatcat:g72cponeu5hinmgpusd5rm63pm

Guaranteeing the topology of an implicit surface polygonization for interactive modeling

Barton T. Stander, John C. Hart
1997 Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97  
Morse theory shows how the topology of an implicit surface is affected by its function's critical points, whereas catastrophe theory shows how these critical points behave as the function's parameters  ...  The impact of this work is a topologically-guaranteed polygonization technique, and the ability to directly and accurately manipulate polygonized implicit surfaces in real time.  ...  This research focused on 3-D implicit surfaces. Its application to the polygonization and modeling of 2-D implicit curves would be a useful, though perhaps now trivial, simplification.  ... 
doi:10.1145/258734.258868 dblp:conf/siggraph/StanderH97 fatcat:rhyhbed5nvavpmzzdkhijbgk5i

Guaranteeing the topology of an implicit surface polygonization for interactive modeling

Barton T. Stander, John C. Hart
2005 ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05  
Morse theory shows how the topology of an implicit surface is affected by its function's critical points, whereas catastrophe theory shows how these critical points behave as the function's parameters  ...  The impact of this work is a topologically-guaranteed polygonization technique, and the ability to directly and accurately manipulate polygonized implicit surfaces in real time.  ...  This research focused on 3-D implicit surfaces. Its application to the polygonization and modeling of 2-D implicit curves would be a useful, though perhaps now trivial, simplification.  ... 
doi:10.1145/1198555.1198642 dblp:conf/siggraph/StanderH05 fatcat:ish7v775i5cu5nhym3a6kexsbm
« Previous Showing results 1 — 15 out of 1,441 results