A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers

DOI10.1137/0727074zbMath0714.65024OpenAlexW2017223384MaRDI QIDQ3200461

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

zbMATH Keywords

convex hull Delaunay triangulation closest point problems nonconvex regions optimal path of a robot presence of barriers

Mathematics Subject Classification ID

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)

Related Items (12)

Dealing with extremely large deformation by Nearest-Nodes FEM with algorithm for updating element connectivity ⋮ A framework for advancing front techniques of finite element mesh generation ⋮ On computing derivatives for \(C^ 1\) interpolating schemes: An optimization ⋮ A NOTE ON THE CLOSURE OF CONVOLUTION POWER MIXTURES (RANDOM SUMS) OF EXPONENTIAL DISTRIBUTIONS ⋮ Generalized Delaunay triangulations of non-convex domains ⋮ Automatic generation of transitional meshes ⋮ The legacy of automatic mesh generation from solid modeling ⋮ A data modeling abstraction for describing triangular mesh algorithms ⋮ Approximating constrained tetrahedrizations ⋮ Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation ⋮ About Delaunay triangulations and discrete maximum principles for the linear conforming FEM applied to the Poisson equation. ⋮ 2D and 3D finite element meshing and remeshing

This page was built for publication: A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers