Filters








27 Hits in 5.6 sec

Isosurface stuffing improved: acute lattices and feature matching

Crawford Doran
2013
We present two improvements to Labelle and Shewchuk's isosurface stuffing algorithm for tetrahedral mesh generation.  ...  Our experiments show that for input surfaces with reasonable crease angles, this is generally sufficient to restore mesh quality.  ...  Figure 6 . 2 : 62 Dragon input, h = 0.02. with dihedral angle histogram imum dihedral angle 148.46 • , an improvement of ten degrees on the maximum dihedral angle.  ... 
doi:10.14288/1.0052176 fatcat:lmfjdacwdzclll44mixvmfkkdy

Lattice Cleaving: Conforming Tetrahedral Meshes of Multimaterial Domains with Bounded Quality [chapter]

Jonathan R. Bronson, Joshua A. Levine, Ross T. Whitaker
2013 Proceedings of the 21st International Meshing Roundtable  
The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity.  ...  We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials.  ...  The output meshes have tetrahedral elements with provably bounded dihedral angles as well as a guaranteed fidelity of sufficiently large features.  ... 
doi:10.1007/978-3-642-33573-0_12 pmid:25309969 pmcid:PMC4190882 dblp:conf/imr/BronsonLW12 fatcat:6ncj5zfpuzfqhgnmudlvx5r7wq

Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees

Jonathan Bronson, Joshua A. Levine, Ross Whitaker
2014 IEEE Transactions on Visualization and Computer Graphics  
The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity.  ...  We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials.  ...  The output meshes have tetrahedral elements with provably bounded dihedral angles as well as a guaranteed fidelity of sufficiently large features.  ... 
doi:10.1109/tvcg.2013.115 pmid:24356365 pmcid:PMC4142801 fatcat:pdm2af6m6fdrnp2vtyz6ny6dhu

A Marching-tetrahedra Algorithm for Feature-preserving Meshing of Piecewise-smooth Implicit Surfaces

Brigham Bagley, Shankar P. Sastry, Ross T. Whitaker
2016 Procedia Engineering  
As in the isosurface-stuffing algorithm, we locally warp the initial tessellated domain to ensure that a high-quality surface mesh is generated.  ...  surfaces intersect at sharp angles.  ...  As in the isosurface-stuffing algorithm, we employ a tetrahedral warping strategy to retain higher quality. Section 3 provides a brief description of the isosurface stuffing algorithm.  ... 
doi:10.1016/j.proeng.2016.11.042 fatcat:lybyu54vwrf6lcmemniytnlbte

Liquid simulation on lattice-based tetrahedral meshes

Nuttapong Chentanez
2007 ACM SIGGRAPH 2007 computer animation festival on - SIGGRAPH '07  
Then a mesh generation algorithm called isosurface stuffing discretizes the region enclosed by the new fluid boundary, creating a tetrahedral mesh that grades from a fine resolution at the surface to a  ...  Each successive time step entails creating a new triangulated liquid surface and a new tetrahedral mesh. Semi-Lagrangian advection computes velocities at the current time step on the new mesh.  ...  Acknowledgments We thank the Berkeley graphics group for helpful criticism and comments, and Adam Bargteil for comments and help with the SLC code.  ... 
doi:10.1145/1281740.1281819 dblp:conf/siggraph/Chentanez07 fatcat:lgawhe3wtrdsnikdhzzdzlqktu

Homeomorphic Tetrahedralization of Multi-material Images with Quality and Fidelity Guarantees

Jing Xu, Andrey N. Chernikov
2017 Procedia Engineering  
The algorithm produces meshes with high quality since it provides a guaranteed dihedral angle bound of up to 19.47 • for the output tetrahedra.  ...  The algorithm produces meshes with high quality since it provides a guaranteed dihedral angle bound of up to 19.47 • for the output tetrahedra.  ...  Isosurface Stuffing [11] is a guaranteed-quality tetrahedral meshing algorithm for general surfaces under the assumption that the surface is a smooth 2-manifold.  ... 
doi:10.1016/j.proeng.2017.09.786 fatcat:jaq2rp4stbfafphi7atbnr7dsq

Adaptive and Unstructured Mesh Cleaving

Jonathan R. Bronson, Shankar P. Sastry, Joshua A. Levine, Ross T. Whitaker
2014 Procedia Engineering  
In developing this new framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a generalization of the isosurface stuffing and lattice  ...  This approach is motivated by the observation that while several methods exist for adaptive tetrahedral meshing, they typically have difficulty at geometric boundaries.  ...  We would also like to thank Mark Kim for providing us with a base for the Barnes-Hut acceleration structure.  ... 
doi:10.1016/j.proeng.2014.10.389 pmid:26137171 pmcid:PMC4484869 fatcat:3m7yf2fm7ne4pml4cpkqlrn42e

Guaranteed quality tetrahedral Delaunay meshing for medical images

Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos P. Chrisochoides
2014 Computational geometry  
The last two guarantees assure that the mesh boundary is a good geometrical and topological approximation of the object surface.  ...  We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less than 2, (b) all the boundary facets have planar angles larger than 30 degrees, (c) the symmetric (2-sided) Hausdorff  ...  Although the majority of the output tetrahedra have good angles, there are a few with dihedral angles less than 2 • .  ... 
doi:10.1016/j.comgeo.2013.11.009 fatcat:6lnjy5kgnffozh5jahuce6rctu

Guaranteed Quality Tetrahedral Delaunay Meshing for Medical Images

Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos P. Chrisochoides
2010 2010 International Symposium on Voronoi Diagrams in Science and Engineering  
The last two guarantees assure that the mesh boundary is a good geometrical and topological approximation of the object surface.  ...  We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less than 2, (b) all the boundary facets have planar angles larger than 30 degrees, (c) the symmetric (2-sided) Hausdorff  ...  Although the majority of the output tetrahedra have good angles, there are a few with dihedral angles less than 2 • .  ... 
doi:10.1109/isvd.2010.15 dblp:conf/isvd/FoteinosCC10 fatcat:ldqwepc4crd6zje6fmz4brgw3e

Unstructured Mesh Generation [chapter]

Jonathan Shewchuk
2012 Combinatorial Scientific Computing  
Isosurface stuffing uses an octree to generate a tetrahedral background mesh, and it warps that mesh A tetrahedral mesh by isosurface stuffing [69] .  ...  The provably good isosurface stuffing algorithm of Labelle and Shewchuk [69] generates tetrahedral meshes of domains that have entirely smooth surfaces (i.e. no vertices or ridges), like biological tissues  ...  Today, the two research issues presenting the most difficulty in tetrahedral meshing are sliver removal and domains with small angles.  ... 
doi:10.1201/b11644-11 fatcat:zjfel6436jhwlidqrtkvjt3ezy

Quality encoding for tetrahedral mesh optimization

Kai Xu, Zhi-Quan Cheng, Yanzhen Wang, Yueshan Xiong, Hao Zhang
2009 Computers & graphics  
We define quality differential coordinates (QDC) for per-vertex encoding of the quality of a tetrahedral mesh.  ...  We develop an algorithm for tetrahedral mesh optimization through energy minimization driven by QDC.  ...  Meshes 3 and 4 in Table 5  ... 
doi:10.1016/j.cag.2009.03.020 fatcat:epc3iaqpwvhdxmcdbcbd4gpl7a

Automatic Construction of Coarse, High-Quality Tetrahedralizations that Enclose and Approximate Surfaces for Animation

David A. Stuart, Joshua A. Levine, Ben Jones, Adam W. Bargteil
2013 Proceedings of Motion on Games - MIG '13  
Our approach comprises three steps: we begin with a tetrahedral mesh built from the body-centered cubic lattice that tessellates the bounding box of the input surface; we then perform a sculpting phase  ...  The resulting high-quality, tetrahedral meshes enclose and approximate an input surface mesh, avoiding extrapolation artifacts and ensuring that the resulting coarse volumetric meshes are adequate collision  ...  We also thank Dan Gerszewski and Jonathan Shewchuk for their help with our comparison experiments.  ... 
doi:10.1145/2522628.2522648 dblp:conf/mig/StuartLJB13 fatcat:bewqr5udo5ddloqgpkqs7b7bce

On Volumetric Shape Reconstruction from Implicit Forms [chapter]

Li Wang, Franck Hétroy-Wheeler, Edmond Boyer
2016 Lecture Notes in Computer Science  
analyzes various properties of the main strategies for implicit to explicit volumetric conversions: Marching cubes, Delaunay refinement and CVTs, including accuracy and shape quality of the resulting shape mesh  ...  This is the case with image based reconstructions that produce point clouds from which implicit functions are computed, with for instance a Poisson reconstruction approach.  ...  For example, the isosurface stuffing algorithm from [17] creates a regular tetrahedrization from a body-centered cubic (BCC) grid.  ... 
doi:10.1007/978-3-319-46487-9_11 fatcat:yt5nphml55dmbae67luxw7dyeu

Geometric modeling of subcellular structures, organelles, and multiprotein complexes

Xin Feng, Kelin Xia, Yiying Tong, Guo-Wei Wei
2012 International Journal for Numerical Methods in Biomedical Engineering  
Methods for volumetric meshing have also been presented.  ...  Lagrangian-triangle meshes are employed for the surface presentation.  ...  It is possible to generate tetrahedron meshes directly from 3D images with theoretical bounds on dihedral angles using algorithms such as isosurface stuffing [97] .  ... 
doi:10.1002/cnm.2532 pmid:23212797 pmcid:PMC3568658 fatcat:ydkjo4etpzem3baxtfaj5iz3zq

Adaptive Tetrahedral Meshes for Brittle Fracture Simulation [article]

Dan Koschier, Sebastian Lipponer, Jan Bender
2014 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '04  
We present a method for the adaptive simulation of brittle fracture of solid objects based on a novel reversible tetrahedral mesh refinement scheme.  ...  Once the tensile stress decreases, the mesh refinement is reversed to increase the performance of the simulation.  ...  Later, Labelle and Shewchuck [LS07] presented the isosurface stuffing algorithm, which fills an isosurface with a tetrahedral mesh guaranteeing certain bounds on the dihedral angles.  ... 
doi:10.2312/sca.20141123 fatcat:qd6dcjkrljfg5dvj5rutbolum4
« Previous Showing results 1 — 15 out of 27 results