Abstract
This paper studies efficient path computation methods that can be applied on digital elevation models represented by a triangulation (called polyhedral terrains). The quality of the path is measured in the following aspects: Euclidean length, lying below a given height Z, avoiding large slope regions, and total height difference. Known techniques that can be used are reviewed, and it is shown how to find paths that satisfy one, or a combination, of the given quality measures.
This research is partially supported by the Esprit Basic Research Action 7141 (project AL-COM II: Algorithms and Complexity).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Barrera, R., and J. Vázquez-Gómez, A shortest path algorithm for hierarchical terrain models. Proc. Auto-Carto 9 (1989), pp. 156–263.
de Berg, M, and M. van Kreveld, Trekking in the Alps without freezing or getting tired. Proc. 1st European Symp. on Algorithms (ESA '93), Lect. Notes in Comp. Science 726, Springer-Verlag, pp. 121–132.
Chen, J., and Y. Han, Shortest paths on a polyhedron. Proc. 6th ACM Symp. Comput. Geom. (1990), pp. 360–369.
Cormen, T.H., C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, Cambridge, 1990.
Guibas, L.J. and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4 (1985), pp. 74–223.
Hershberger, J., and S. Suri, On computing Euclidean shortest paths in the plane. Proc. 34th IEEE Symp. on the Found. of Comp. Science (1993).
Laurini, R., and D. Thompson, Fundamentals of spatial information systems. Academic press, 1992.
Mehlhorn, K., Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer-Verlag, Berlin, 1984.
Mitchell, J.S.B., An algorithmic approach to some problems in terrain navigation. Artificial Intelligence 37 (1988), pp. 171–201.
Mitchell, J.S.B., D.M. Mount, and C.H. Papadimitriou, The discrete geodesic problem. SIAM J. Comput. 16 (1987), pp. 647–668.
Mitchell, J.S.B., and C.H. Papadimitriou, The weighted region problem: finding shortest paths through a weighted planar subdivision. J. ACM 38 (1991), pp. 18–73.
Morse, S.P., Concepts of use in computer mapping. Comm. ACM 12 (1969), pp. 147–152.
Peucker, T.K., R.J. Fowler, J.J. Little, and D.M. Mark, The triangulated irregular network. Proc. DTM Symp. Am. Soc. of Photogrammetry—Am. Congress on Survey and Mapping (1978), pp. 24–31.
Preparata F. P., and M. I. Shamos, Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.
Smith, T.R., and R.E. Parker, An analysis of the efficacy and efficiency of hierarchical procedures for computing trajectories over complex surfaces. Eur. J. of Operational Research 30 (1987), pp. 327–338.
van Bemmelen, J., W. Quak, M. van Hekken, and P. van Oosterom, Vector vs. raster-based algorithms for cross country movement planning. Proc. Auto-Carto 11 (1993), pp. 304–317.
Zhan, C., S. Menon, and P. Gao, A directional path distance model for raster distance mapping. Proc. COSIT '93, Lect. Notes in Comp. Science 716, Springer-Verlag, pp. 434–443.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Kreveld, M. (1994). On quality paths on polyhedral terrains. In: Nievergelt, J., Roos, T., Schek, HJ., Widmayer, P. (eds) IGIS '94: Geographic Information Systems. IGIS 1994. Lecture Notes in Computer Science, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58795-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-58795-0_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58795-8
Online ISBN: 978-3-540-49105-7
eBook Packages: Springer Book Archive