Approximating Shortest Paths on Weighted Polyhedral Surfaces

@article{Lanthier2001ApproximatingSP,
  title={Approximating Shortest Paths on Weighted Polyhedral Surfaces},
  author={Mark Lanthier and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack},
  journal={Algorithmica},
  year={2001},
  volume={30},
  pages={527-562}
}
One common problem in computational geometry is that of computing shortest paths between two points in a constrained domain. In the context of Geographical Information Systems (GIS), terrains are often modeled as Triangular Irregular Networks (TIN) which are a special class on non-convex polyhedra. It is often necessary to compute shortest paths on the TIN surface which takes into account various weights according to the terrain features. We have developed algorithms to compute approximations… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

Exact Geodesics and Shortest Paths on Polyhedral Surfaces

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2009
View 4 Excerpts
Highly Influenced

Finding optimal weighted bridges with applications

ACM Southeast Regional Conference • 2006
View 11 Excerpts
Highly Influenced

AN intelligent road traffic management system using NVIDIA GPU

2016 19th International Conference on Computer and Information Technology (ICCIT) • 2016
View 1 Excerpt

Shortest path-planning on polygonal surfaces with O (nlog n) time

2016 IEEE International Conference on Control and Robotics Engineering (ICCRE) • 2016
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision

J.S.B. Mitchell, C. H. Papadimitriou, The
Journal of the ACM, • 1991
View 8 Excerpts
Highly Influenced

An Algorithm for Shortest-Path Motion in Three Dimensions

Inf. Process. Lett. • 1985
View 12 Excerpts
Highly Influenced

Approximating Shortest Paths on a Polyhedron",Proceedings of the 38th

P. K. Agarwal, K. R. Varadarajan
IEEE Symp. on Foundations of Com- puter Science, • 1997
View 6 Excerpts
Highly Influenced

Shortest Paths on a Polyhedron

Symposium on Computational Geometry • 1990
View 4 Excerpts
Highly Influenced

Shortest Paths Amidst Convex Polyhedra

M. Sharir, On
SIAM Journal of Computing, • 1987
View 10 Excerpts
Highly Influenced

Shortest Paths in Polyhedral Spaces

M. Sharir, A. Schorr, On
SIAM Journal of Computing, • 1986
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…