Results 1  10
of
328
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
 In Proceedings of the 14th International Meshing Roundtable
, 2005
"... Summary. We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of nonexistence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
Summary. We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of nonexistence of a CDT by updating the input PLC into another PLC which is topologically and geometrically
Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
 In Eleventh International Meshing Roundtable
, 2002
"... In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enfor ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
of enforcing boundary conformityensuring that triangulation edges cover the boundaries (both interior and exterior) of the domain being modeled. This paper discusses the threedimensional analogue, constrained Delaunay tetrahedralizations (also called CDTs), and their advantages in mesh generation. CDTs
Geometric Validation of GML Solids with the Constrained Delaunay Tetrahedralization∗
"... To facilitate and encourage the exchange and interoperability of geographical information, the ISO1 and the OGC2 have developed in recent years standards that define what the basic geographical primitives are (ISO, TC211), and also how they can be implemented (OGC, 2007, 2006). While the definitions ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
To facilitate and encourage the exchange and interoperability of geographical information, the ISO1 and the OGC2 have developed in recent years standards that define what the basic geographical primitives are (ISO, TC211), and also how they can be implemented (OGC, 2007, 2006). While the definitions for the primitives are not restricted to 2D, most of the efforts for the implementation of these
Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations with Finite Precision Coordinates
"... Summary. Constrained Delaunay tetrahedralizations (CDTs) are valuable for generating meshes of nonconvex domains and domains with internal boundaries, but they are difficult to maintain robustly when finiteprecision coordinates yield vertices on a line that are not perfectly collinear and polygonal ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Summary. Constrained Delaunay tetrahedralizations (CDTs) are valuable for generating meshes of nonconvex domains and domains with internal boundaries, but they are difficult to maintain robustly when finiteprecision coordinates yield vertices on a line that are not perfectly collinear
The Strange Complexity of Constrained Delaunay Triangulation
 Proceedings of the Fifteenth Canadian Conference on Computational Geometry
, 2003
"... The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NPcomplete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomialtime solution. Constrained Delaunay tetrahedralization has the unusual status (for a smalld ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NPcomplete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomialtime solution. Constrained Delaunay tetrahedralization has the unusual status (for a
Abstract The Strange Complexity of Constrained Delaunay Triangulation
"... The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NPcomplete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomialtime solution. Constrained Delaunay tetrahedralization has the unusual status (for a small ..."
Abstract
 Add to MetaCart
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NPcomplete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomialtime solution. Constrained Delaunay tetrahedralization has the unusual status (for a
On Refinement of Constrained Delaunay
"... Summary. This paper discusses the problem of refining constrained Delaunay tetrahedralizations (CDTs) into good quality meshes suitable for adaptive numerical simulations. A practical algorithm which extends the basic Delaunay refinement scheme is proposed. It generates an isotropic mesh correspondi ..."
Abstract
 Add to MetaCart
Summary. This paper discusses the problem of refining constrained Delaunay tetrahedralizations (CDTs) into good quality meshes suitable for adaptive numerical simulations. A practical algorithm which extends the basic Delaunay refinement scheme is proposed. It generates an isotropic mesh
Tetrahedral Mesh Generation by Delaunay Refinement
 Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than two ..."
Abstract

Cited by 133 (6 self)
 Add to MetaCart
Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than
Constrained Delaunay triangulations
 Algorithmica
, 1989
"... Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the De ..."
Abstract

Cited by 207 (4 self)
 Add to MetaCart
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible
Delaunay Tetrahedralization using an AdvancingFront Approach
 5th International Meshing Roundtable, SAND 952130, Sandia National Laboratories
, 1996
"... . This paper presents a procedure for efficient generation of threedimensional unstructured meshes of tetrahedral elements. Initially, a constrained Delaunay mesh is generated wherein internal points are created using advancingfront point placement and are inserted using a Delaunay method. The ove ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
. This paper presents a procedure for efficient generation of threedimensional unstructured meshes of tetrahedral elements. Initially, a constrained Delaunay mesh is generated wherein internal points are created using advancingfront point placement and are inserted using a Delaunay method
Results 1  10
of
328