A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 27 (5) , 1305-1321
- https://doi.org/10.1137/0727074
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Computational GeometryPublished by Springer Nature ,1985
- Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the PlaneACM Transactions on Mathematical Software, 1984
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- A triangle-based $C^1$ interpolation methodRocky Mountain Journal of Mathematics, 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979