Construction of three-dimensional Delaunay triangulations using local transformations

DOI10.1016/0167-8396(91)90038-DzbMATH Open0729.65120MaRDI QIDQ807005FDOQ807005

Publication date: 1991

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Recommendations

Three-Dimensional Triangulations from Local Transformations
Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
OPTIMAL DELAUNAY POINT INSERTION
Fast Delaunay triangulation in three dimensions
Construction of K-Dimensional Delaunay Triangulations Using Local Transformations

Delaunay triangulation local transformations worst case time complexity expected 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)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On the Average Number of Maxima in a Set of Vectors and Applications
An apporach to automatic three-dimensional finite element mesh generation
Delaunay Triangular Meshes in Convex Polygons
Title not available (Why is that?)
Properties of \(n\)-dimensional triangulations
A fast algorithm for constructing Delaunay triangulations in the plane
Tetrahedrizing point sets in three dimensions
Three-Dimensional Triangulations from Local Transformations

Cited In (46)

Generation of non-isotropic unstructured grids via directional enrichment
The hybrid quintic Bézier tetrahedron
Approximating constrained tetrahedrizations
The particle finite element method (PFEM) in thermo-mechanical problems
On local transformation of polygons with visibility properties.
Geometric triangulations and discrete Laplacians on manifolds: an update
Fast Delaunay triangulation in three dimensions
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
Title not available (Why is that?)
Secondary Power Diagram, Dual of Secondary Polytope
Piecewise linear approximation by the method of worst segment division
Delaunay triangulation and the convex hull of n points in expected linear time
A fast algorithm for constructing Delaunay triangulations in the plane
Regular triangulations of dynamic sets of points
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Automatic generation of transitional meshes.
Pointwise rates of convergence for the Oliker-Prussner method for the Monge-Ampère equation
Incremental topological flipping works for regular triangulations
Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
The Singularity Set of Optimal Transportation Maps
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
Constrained paths in the flip-graph of regular triangulations
Construction of the Delaunay superlarge triangulation
Title not available (Why is that?)
Triangulating point sets in space
ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
The singularity set of optimal transportation maps
Secondary polytope and secondary power diagram
A 3D flow-aligning algorithm for convection-diffusion problems
The legacy of automatic mesh generation from solid modeling
Structural tolerance and Delaunay triangulation
Three-Dimensional Triangulations from Local Transformations
3D simulation of fluid-particle interactions with the number of particles reaching 100
Flow simulation and high performance computing
Projections of polytopes and the generalized Baues conjecture
2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
Optimal tetrahedral mesh generation for three-dimensional point set
Title not available (Why is that?)
Construction of K-Dimensional Delaunay Triangulations Using Local Transformations
Flip Algorithm for Segment Triangulations
Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
A quasi-static dual particle method for solids based on dual particle dynamics
Breakthrough `workarounds' in unstructured mesh generation
Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

This page was built for publication: Construction of three-dimensional Delaunay triangulations using local transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807005)