A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
DOI10.1137/0727074zbMATH Open0714.65024OpenAlexW2017223384MaRDI QIDQ3200461FDOQ3200461
Authors: A. K. Cline, Robert J. Renka
Publication date: 1990
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0727074
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
convex hullDelaunay triangulationclosest point problemsnonconvex regionsoptimal path of a robotpresence of barriers
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) General theory of distance geometry (51K05) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Cited In (12)
- A framework for advancing front techniques of finite element mesh generation
- Approximating constrained tetrahedrizations
- Dealing with extremely large deformation by Nearest-Nodes FEM with algorithm for updating element connectivity
- Generalized Delaunay triangulations of non-convex domains
- Automatic generation of transitional meshes.
- About Delaunay triangulations and discrete maximum principles for the linear conforming FEM applied to the Poisson equation.
- The legacy of automatic mesh generation from solid modeling
- A NOTE ON THE CLOSURE OF CONVOLUTION POWER MIXTURES (RANDOM SUMS) OF EXPONENTIAL DISTRIBUTIONS
- Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- On computing derivatives for \(C^ 1\) interpolating schemes: An optimization
- A data modeling abstraction for describing triangular mesh algorithms
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)