Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,994,728
Quality Mesh Generation in Three Dimensions
, 1992
"... We show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is optimal in the following two senses. First, our triangulation achieves the best possible aspect ratio up to a constant. Second, for any other triangulation of the same region into m triangles with b ..."
Abstract
-
Cited by 87 (4 self)
- Add to MetaCart
with bounded aspect ratio, our triangulation has size n = O(m). Such a triangulation is desired as an initial mesh for a finite element mesh refinement algorithm. Previous three dimensional triangulation schemes either worked only on a restricted class of input, or did not guarantee well-shaped tetrahedra
Quality Mesh Generation in Higher Dimensions
, 1996
"... We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation ..."
Abstract
-
Cited by 53 (7 self)
- Add to MetaCart
We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation
Imesh: An image based quality mesh generation technique, in
- IEEE Proceedings SIBGRAPI’05, 2005
"... Generating triangular meshes from images is a task im-portant to many applications. Usually, techniques that can do that either take as starting point a segmented image or generate a mesh without distinguishing different struc-tures contained in the image. In both cases the results can be satisfacto ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
for mesh generation that handles these problems well. First, it eliminates the need for pre-processing by building the segmentation into the mesh gen-eration process. Second, the mesh generation process takes into acount the quality of the mesh elements, producing as result meshes of better quality than
Approximate Quality Mesh Generation Based On Small Edge Details
"... We present two techniques for simplifying the list processing required by methods for quality mesh generation based on iterative bad triangle improvement over Delaunay meshes which use the standard basic components of insertion point selection and Delaunay insertion. The simplication involves compro ..."
Abstract
- Add to MetaCart
We present two techniques for simplifying the list processing required by methods for quality mesh generation based on iterative bad triangle improvement over Delaunay meshes which use the standard basic components of insertion point selection and Delaunay insertion. The simplication involves
Quality Mesh Generation for Molecular Skin Surfaces Using Restricted Union of Balls
- in IEEE Visualization
, 2005
"... Figure 1: Molecular models of the molecule Helix. The leftmost shows the van der Waals surface model; the center shows the molecular skin model and the rightmost shows the magnified mesh details in the box of the center figure. Quality surface meshes for molecular models are desirable in the studies ..."
Abstract
-
Cited by 34 (2 self)
- Add to MetaCart
in the studies of protein shapes and functionalities. However, there is still no robust software that is capable to generate such meshes with good quality. In this paper, we present a Delaunay-based surface triangulation algorithm generating quality surface meshes for the molecular skin model. We expand
CONFORMING CENTROIDAL VORONOI DELAUNAY TRIANGULATION FOR QUALITY MESH GENERATION
"... Abstract. As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
Abstract. As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a
1High-Quality Mesh Generation Based on Orthogonal Software Modules
"... Abstract—To provide simulation software in the field of TCAD with the utmost flexibility regarding generation and adaptation of meshes, a generic and high-quality meshing library, ViennaMesh, has been developed. The library is coded in C++ and utilizes mod-ern programming techniques to wrap tasks, l ..."
Abstract
- Add to MetaCart
Abstract—To provide simulation software in the field of TCAD with the utmost flexibility regarding generation and adaptation of meshes, a generic and high-quality meshing library, ViennaMesh, has been developed. The library is coded in C++ and utilizes mod-ern programming techniques to wrap tasks
High Quality Mesh Generation and Sparse Representation Using B-Splines
, 2000
"... We present two methods for generating hexahedral meshes. Both methods can be combined. The rst method is of algebraic nature. We use cubic blends (Coons patches) to achieve orthogonality at least at the boundaries. The second one is based on level set computation using B-Splines. The level set curve ..."
Abstract
- Add to MetaCart
We present two methods for generating hexahedral meshes. Both methods can be combined. The rst method is of algebraic nature. We use cubic blends (Coons patches) to achieve orthogonality at least at the boundaries. The second one is based on level set computation using B-Splines. The level set
Results 1 - 10
of
1,994,728
