Construction of three-dimensional Delaunay triangulations using local transformations
From MaRDI portal
Publication:807005
DOI10.1016/0167-8396(91)90038-DzbMath0729.65120MaRDI QIDQ807005
Publication date: 1991
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Delaunay triangulationlocal transformationsworst case time complexityexpected complexity for random points
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of higher-dimensional varieties (14Q15) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)
Related Items (32)
ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS ⋮ SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS ⋮ Incremental topological flipping works for regular triangulations ⋮ Flow simulation and high performance computing ⋮ Optimal tetrahedral mesh generation for three-dimensional point set ⋮ 3D simulation of fluid-particle interactions with the number of particles reaching 100 ⋮ Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains ⋮ The singularity set of optimal transportation maps ⋮ Constrained paths in the flip-graph of regular triangulations ⋮ The hybrid quintic Bézier tetrahedron ⋮ A quasi-static dual particle method for solids based on dual particle dynamics ⋮ The particle finite element method (PFEM) in thermo-mechanical problems ⋮ Secondary Power Diagram, Dual of Secondary Polytope ⋮ Secondary polytope and secondary power diagram ⋮ Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance ⋮ Pointwise rates of convergence for the Oliker-Prussner method for the Monge-Ampère equation ⋮ Automatic generation of transitional meshes ⋮ The legacy of automatic mesh generation from solid modeling ⋮ Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions ⋮ Generation of non-isotropic unstructured grids via directional enrichment ⋮ 2D and 3D finite element meshing and remeshing ⋮ Flip Algorithm for Segment Triangulations ⋮ A 3D flow-aligning algorithm for convection-diffusion problems ⋮ Projections of polytopes and the generalized Baues conjecture ⋮ Piecewise linear approximation by the method of worst segment division ⋮ Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique ⋮ Fast Delaunay triangulation in three dimensions ⋮ Unnamed Item ⋮ Breakthrough `workarounds' in unstructured mesh generation ⋮ On local transformation of polygons with visibility properties. ⋮ The Singularity Set of Optimal Transportation Maps ⋮ Regular triangulations of dynamic sets of points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of \(n\)-dimensional triangulations
- Tetrahedrizing point sets in three dimensions
- An apporach to automatic three-dimensional finite element mesh generation
- A fast algorithm for constructing Delaunay triangulations in the plane
- Delaunay Triangular Meshes in Convex Polygons
- On the Average Number of Maxima in a Set of Vectors and Applications
- Three-Dimensional Triangulations from Local Transformations
This page was built for publication: Construction of three-dimensional Delaunay triangulations using local transformations
