Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
41
Conforming Delaunay Tetrahedronized Networks, Surface Reconstruction, Data Dependent Triangulations
"... The Triangulated Irregular Network (TIN) created by the 3D-Analyst extensions of ArcGIS 8.x and ArcView 3.x are based on the Delaunay empty circum circle criterion, which is believed to optimize how faces model a surface. This is not the case as this algorithm ignores the Z-value of the surface poin ..."
Abstract
- Add to MetaCart
points. To get a better representation of the surface this papers describes a method based on the Delaunay Tetrahedronized Irregular Network (TEN). This TEN stores the measurements (lines-off-sight to the surface-points). An ArcView algorithm is applied on this TEN to retrieve the TIN that represents
Piecewise Linear Complex represenation through Conforming Delaunay Tetrahedronization
"... The boundary of three-dimensional objects is usually represented by Piecewise Linear Complexes (PLCs). A PLC is a set of vertices, segments and facets. The definition of PLCs requires that they must be closed under taking intersections; two segments can intersect only at a shared point, and two face ..."
Abstract
- Add to MetaCart
Delaunay Tetrahedronization (CDT) from these PLCs by adding Steiner points where necessary to obey the Delaunay empty circum sphere criterion. Once the CDT is generated, the PLC is part of this CDT. If a boundary marker is assigned to each facet of the PLC, all boundary faces on that facet in the final
Perturbations for Delaunay and weighted Delaunay 3D Triangulations
, 2011
"... The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exis ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron
Quality Meshing with Weighted Delaunay Refinement
- SIAM J. Comput
, 2002
"... Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra called slivers that can occur in such a mesh can be eliminated by the sliver exudation method. This method has been shown to work for periodic ..."
Abstract
-
Cited by 40 (7 self)
- Add to MetaCart
quality tetrahedron including slivers. This success is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation. We show that an incremental weight pumping can be mixed seamlessly with vertex insertions in our weighted Delaunay
Functional Delaunay Refinement
- In 7th International Conference on Numerical Grid Generation in Computational Field Simulations
, 2000
"... : Given a complex of vertices, constraining segments (and planar straightline constraining facets in 3D) and an ff-Lipschitz control spacing function f() over the domain, an algorithm presented herein can generate a conforming mesh of Delaunay triangles (tetrahedra in 3D) whose circumradius-toshor ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
-toshortest -edge ratios are no greater than p 2 (2 in 3D). The triangle (tetrahedron) size is within a constant factor of f (). An implementation in 2D demonstrates that the algorithm generates excellent mesh. Keywords: unstructured mesh generation, delaunay refinement, control spacing, mesh conformity. 1
Sliver-free Three Dimensional Delaunay Mesh Generation
- PH.D THESIS, UIUC
, 2000
"... A key step in the nite element method is to generate well-shaped meshes in 3D. A mesh is well-shaped if every tetrahedron element has a small aspect ratio. It is an old outstanding problem to generate well-shaped Delaunay meshes in three or more dimensions. Existing algorithms do not completely solv ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
A key step in the nite element method is to generate well-shaped meshes in 3D. A mesh is well-shaped if every tetrahedron element has a small aspect ratio. It is an old outstanding problem to generate well-shaped Delaunay meshes in three or more dimensions. Existing algorithms do not completely
DELAUNAY TETRAHEDRALIZATIONS: HONOR DEGENERATED CASES
"... The definition of a Delaunay tetrahedralization (DT) of a set S of points is well known: a DT is a tetrahedralization of S in which every simplex (tetrahedron, triangle, or edge) is Delaunay. A simplex is Delaunay if all of its vertices can be connected by a circumsphere that encloses no other verte ..."
Abstract
- Add to MetaCart
The definition of a Delaunay tetrahedralization (DT) of a set S of points is well known: a DT is a tetrahedralization of S in which every simplex (tetrahedron, triangle, or edge) is Delaunay. A simplex is Delaunay if all of its vertices can be connected by a circumsphere that encloses no other
Perturbing Slivers in 3D Delaunay Meshes
- 18TH INTERNATIONAL MESHING ROUNDTABLE (2009) 157-173
, 2009
"... Isotropic tetrahedron meshes generated by Delaunay triangulations are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay for simplicit ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
Isotropic tetrahedron meshes generated by Delaunay triangulations are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay
Scanline forced Delaunay TENs for surface representation
"... The general idea that a Delaunay TIN (DT) is more appropriate than non-Delaunay TINs, due to ‘better ’ shaped triangles, might be true for many applications, but not for height dependent analytical queries. This is because the distribution of the triangle tessellation is defined in the two-dimension ..."
Abstract
- Add to MetaCart
‘real ’ 3D triangulation construction method, resulting in a Tetrahedronized Irregular Network. This TEN is capable to store all kinds of surfacefeatures (as the target-points) and the scanlines as well. The scanlines are forced to split by adding Steiner points until they are part of the Delaunay TEN
Results 1 - 10
of
41
