A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
From MaRDI portal
Publication:3200461
Recommendations
- Constrained Delaunay triangulations
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- scientific article; zbMATH DE number 1139074
- A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
- scientific article; zbMATH DE number 5063802
Cited in
(12)- Approximating constrained tetrahedrizations
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- On computing derivatives for \(C^ 1\) interpolating schemes: An optimization
- A framework for advancing front techniques of finite element mesh generation
- The legacy of automatic mesh generation from solid modeling
- About Delaunay triangulations and discrete maximum principles for the linear conforming FEM applied to the Poisson equation.
- Generalized Delaunay triangulations of non-convex domains
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- A data modeling abstraction for describing triangular mesh algorithms
- Automatic generation of transitional meshes.
- A NOTE ON THE CLOSURE OF CONVOLUTION POWER MIXTURES (RANDOM SUMS) OF EXPONENTIAL DISTRIBUTIONS
- Dealing with extremely large deformation by Nearest-Nodes FEM with algorithm for updating element connectivity
This page was built for publication: A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200461)