Skip to main content
SpringerLink
Log in

Digital elevation models and TIN algorithms

  • Chapter
  • First Online:
Algorithmic Foundations of Geographic Information Systems (CISM School 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1340))

Abstract

This survey has explained a number of concepts on terrains, and some algorithms for various computations. The emphasis has been on TIN algorithms, because the TIN model for terrains is more elegant than the grid and contour line models. A common argument to use grids is the simplicity of the algorithms. However, the current trends in GIS research and in the field of computational geometry have shown that algorithms on TINS need not be . either. More programming effort is required, but this need not outweigh the advantages that TINS have to offer. We won't repeat arguments in the raster-vector debate; a summary of algorithmic methods and specific algorithms for TINS is useful in any case. The search for efficient algorithms on terrains is an interesting area of research where the GIS developers, GIS researchers, and computational geometers can work together to develop a variety of elegant and efficient solutions to practical problems on terrains. The analysis of efficiency of these solutions should be based on realistic assumptions on terrains.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.L. Bajaj, V. Pascucci, and D.R. Schikore. Past isocontouring for improved interactivity. In Proc. IEEE Visualization, 1996.

    Google Scholar 

  2. M. Bern, D. Dobkin, D. Eppstein, and R. Grossman, Visibility with a moving point of view. Algorithmica, 11:360–378, 1994.

    Google Scholar 

  3. P. Bose and L. Devroye. Intersections with random geometric objects. Manuscript.

    Google Scholar 

  4. P. A. Burrough. Principles of Geographical Information Systems for Land Resourses Assessment. Oxford University Press, New York, 1986.

    Google Scholar 

  5. J.R. Carter. The effect of data precision on the calculation of slope and aspect using gridded DEMs. Cartographica, 29:22–34, 1992.

    Google Scholar 

  6. K.-T. Chang and B.-W. Tsai. The effect of DEM resolution on slope and aspect mapping. Cartography and Geographic Information Systems, 18:69–77, 1991.

    Google Scholar 

  7. J. Chen and Y. Han. Shortest paths on a polyhedron. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 360–369, 1990.

    Google Scholar 

  8. Z.-T. Chen and J.A. Guevara. Systematic selection of very important points (vip) from digital terrain model for constructing triangular irregular networks. In Proc. Auto-Carto 8, pages 50–56, 1987.

    Google Scholar 

  9. L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97–108, 1989.

    Google Scholar 

  10. A.H.J. Christensen. Pitting a triangulation to contours. In Proc. Auto-Carto 8, pages 57–67, 1987.

    Google Scholar 

  11. K. C. Clarke. Analytical and Computer Cartography. Prentice Hall, Englewood Cliffs, NJ, 2nd edition, 1995.

    Google Scholar 

  12. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387–421, 1989.

    Google Scholar 

  13. R. Cole and M. Sharir. Visibility problems for polyhedral terrains. J. Symbolic Comput., 7:11–30, 1989.

    Google Scholar 

  14. N.A.C. Cressie. Statistics for Spatial Data. Wiley, New York, 1991.

    Google Scholar 

  15. J.C. Davis. Statistics and Data Analysis in Geology. Wiley, New York, 2nd edition, 1986.

    Google Scholar 

  16. M. de Berg, P. Bose, K. Dobrint, M. van Kreveld, M. Overmars, M. de Groot, T. Roos, J. Snoeyink, and S. Yu. The complexity of rivers in triangulated terrains. In Proc. 8th Canad. Conf. Comput. Geom., pages 325–330, 1996.

    Google Scholar 

  17. M. de Berg and M. van Kreveld. Trekking in the Alps without freezing or getting tired. Algorithmica, 18:306–323, 1997.

    Google Scholar 

  18. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry — Algorithms and Applications. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  19. M. de Berg, M. van Kreveld, R. van Oostrum, and M. Overmars. Simple traversal of a subdivision without extra storage. Int. J. of GIS, 11:359–373, 1997.

    Google Scholar 

  20. Mark de Berg and Katrin Dobrindt. On levels of detail in terrains. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C26–C27, 1995.

    Google Scholar 

  21. L. De Floriani. A pyramidal data structure for triangle-based surface description. IEEE Comput. Graph. Appl., 9(2):67–78, March 1989.

    Google Scholar 

  22. L. De Floriani and E. Puppo. A survey of constrained Delaunay triangulation algorithms for surface representaion. In G. G. Pieroni, editor, Issues on Machine Vision, pages 95–104. Springer-Verlag, New York, NY, 1989.

    Google Scholar 

  23. Leila De Floriani, Bianca Falcidieno, George Nagy, and Caterina Pienovi. Hierarchical structure for surface approximation. Comput. Graph. (UK), 8(2):183–193, 1984.

    Google Scholar 

  24. D. DiBiase, A.M. MacEachren, J.B. Krygier, and C. Reeves. Animation and the role of map design in scientific visualization. Cartography and Geographic Information Systems, 19:201–214, 1992.

    Google Scholar 

  25. H. Edelsbrunner. Dynamic data structures for orthogonal intersection queries. Report F59, Inst. Informationsverarb., Tech. Univ. Graz, Graz, Austria, 1980.

    Google Scholar 

  26. H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317–340, 1986.

    Google Scholar 

  27. I. S. Evans. The selection of class intervals. Trans. Inst. Br. Geogrs., 2:98–124, 1977.

    Google Scholar 

  28. B. Falcidieno and C. Pienovi. A feature-based approach to terrain surface approximation. In Proc. 4th Int. Symp. on Spatial Data Handling, pages 190–199, 1990.

    Google Scholar 

  29. B. Falcidieno and M. Spagnuolo. A new method for the characterization of topographic surfaces. Int. J. of GIS, 5:397–412, 1991.

    Google Scholar 

  30. Ulrich Finke and Klaus Hinrichs. Overlaying simply connected planar subdivisions in linear time. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 119–126, 1995.

    Google Scholar 

  31. P. F. Fisher. Algorithm and implementation uncertainty in viewshed analysis. Internat. J. Geogr. Inform. Syst., 7:331–347, 1993.

    Google Scholar 

  32. P. F. Fisher. Stretching the viewshed. In Proc. 6th Internat. Sympos. Spatial Data Handling, pages 725–738, 1994.

    Google Scholar 

  33. P. F. Fisher. Reconsideration of the viewshed function in terrain modelling. Geogr. Syst., 3:33–58, 1996.

    Google Scholar 

  34. P.-O. Fjällström. Polyhedral approximation of bivariate functions. In Proc. 3rd Canad. Conf. Comput. Geom., pages 187–190, 1991.

    Google Scholar 

  35. L. De Floriani, B. Falcidieno, C. Pienovi, D. Allen, and G. Nagy. A visibility-based model for terrain features. In Proc. 2nd Int. Symp. on Spatial Data Handling, pages 235–250, 1986.

    Google Scholar 

  36. L. De Floriani, P. Marzano, and E. Puppo. Hierarchical terrain models: survey and formalization. In Proc. ACM Symp. on Applied Computing, 1994.

    Google Scholar 

  37. L. De Floriani, D. Mirra, and E. Puppo. Extracting contour lines from a hierarchical surface model. In Eurographics'93, volume 12, pages 249–260, 1993.

    Google Scholar 

  38. L. De Floriani and E. Puppo. A hierachical triangle-based model for terrain description. In Theories and Methods of Spatio-Temporal Reasoning in Geographic Space, proceedings, volume 639 of Lecture Notes in Computer Science, pages 236–251, Berlin, 1992. Springer-Verlag.

    Google Scholar 

  39. L. De Floriani, E. Puppo, and G. Nagy. Computing a line-of-sight network on a terrain model. In Proc. 5th Int. Symp. on Spatial Data Handling, pages 672–681, 1992.

    Google Scholar 

  40. J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  41. R. J. Fowler and J. J. Little. Automatic extraction of irregular network digital terrain models. Comput. Graph., 13(2);199–207, August 1979.

    Google Scholar 

  42. A.U. Frank, B. Palmer, and V.B. Robinson. Formai methods for the accurate definition of some fundamental terms in physical geography. In Proc. 2nd Int. Symp. on Spatial Data Handling, pages 583–599, 1986.

    Google Scholar 

  43. Wm Randolph Franklin. Compressing elevation data. In Advances in Spatial Databases (SSD'95), number 951 in Lecture Notes in Computer Science, pages 385–404, Berlin, 1995. Springer-Verlag.

    Google Scholar 

  44. Wm. Randolph Franklin and C. K. Ray. Higher isn't necessarily better: Visibility algorithms and experiments. In Proc. 6th Internat. Sympos. Spatial Data Handling, pages 751–763, 1994.

    Google Scholar 

  45. Wm. Randolph Franklin and A. Said. Lossy compression of elevation data. In Proc. 7th Int. Symp. on Spatial Data Handling, pages 8B.29–8B.41, 1996.

    Google Scholar 

  46. H. Freeman and S.P. Morse. On searching a contour map for a given terrain elevation profile. J. of The Franklin Institute, 284:1–25, 1967.

    Google Scholar 

  47. A.B. García, C.G. Nicieza, J.B.O. Meré, and A.M. Diaz. A contour line based triangulation algorithm. In Proc. 5th Int. Symp. on Spatial Data Handling, pages 411–421, 1992.

    Google Scholar 

  48. P.K. Garg and A.R. Harrison. Quantitative representation of land-surface morphology from digital elevation models. In Proc. 4th Int. Symp. on Spatial Data Handling, pages 273–284, 1990.

    Google Scholar 

  49. M. Garland and P.S. Heckbert. Fast polygonal approximation of terrains and height fields. Technical Report CMU-CS-95-181, Carnegie Mellon University, 1995.

    Google Scholar 

  50. C. Gold. The practical generation and use of geography triangular element data. In Harvard Papers on Geographic Information Systems, volume 5. 1978.

    Google Scholar 

  51. C. Gold and S. Cormack. Spatially ordered networks and topographic reconstructions. In Proc. 2nd Int. Sympos. Spatial Data Handling, pages 74–85, 1986.

    Google Scholar 

  52. C. Gold and T. Roos. Surface modelling with guaranteed consistency — an object-based approach. In IGIS'94 Geographic Information Systems, number 884 in Lecture Notes in Computer Science, pages 70–87, Berlin, 1994. Springer-Verlag.

    Google Scholar 

  53. C. M. Gold, T. D. Charters, and J. Ramsden. Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain. Comput. Graph., 11(2):170–175, 1977.

    Google Scholar 

  54. C.M. Gold. Neighbours, adjacency and theft — the Voronoi process for spatial analysis. In Proc. 1st Eur. Conf. on Geographical Information Systems, 1990.

    Google Scholar 

  55. C.M. Gold and U. Maydell. Triangulation and spatial ordering in computer carthography. In Proc. Canad. Cartographic Association Annual Meeting, pages 69–81, 1978.

    Google Scholar 

  56. A. Goudie, editor. Geomorphological Techniques. George Allen & Unwin, London, 1981.

    Google Scholar 

  57. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381–413, 1992.

    Google Scholar 

  58. L. J. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom., 2:175–193, 1987.

    Google Scholar 

  59. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph., 4:74–123, 1985.

    Google Scholar 

  60. M.G. Hart. Geomorphology — pure and applied. George Allen & Unwin, London, 1986.

    Google Scholar 

  61. M. Heller. Triangulation algorithms for adaptive terrain modeling. In Proc. 4th Int. Symp. on Spatial Data Handling, pages 163–174, 1990.

    Google Scholar 

  62. E. H. Isaaks and R. M. Srivastava. An Introduction to Applied Geostatistics. Oxford University Press, New York, 1989.

    Google Scholar 

  63. S.K. Jenson. Automated derivation of hydrologic basin characteristics from digital elevation model data. In Proc. ASP/ACSM, pages 301–310, 1985.

    Google Scholar 

  64. S.K. Jenson and C.M. Trautwein. Methods and applications in surface depression analysis. In Proc. Auto-Carto 8, pages 137–144, 1987.

    Google Scholar 

  65. C.B. Jones, J.M. Ware, and G.L. Bundy. Multiscale spatial modelling with triangulated surfaces. In Proc. 5th Int. Symp. on Spatial Data Handling, pages 612–621, 1992.

    Google Scholar 

  66. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28–35, 1983.

    Google Scholar 

  67. A. Kousoulakou and M.-J. Kraak. Spatio-temporal maps and cartographic communication. Cartographic Journal, 29:101–108, 1992.

    Google Scholar 

  68. M.-J. Kraak and A.M. MacEachren. Visualization of the temporal component of spatial data. In Proc. 6th Int. Symp. on Spatial Data Handling, pages 391–409, 1994.

    Google Scholar 

  69. M.-J. Kraak and F.J. Ormeling. Cartography — visualization of spatial data. Longman, Harlow, 1996.

    Google Scholar 

  70. M.-J. Kraak and E. Verbree. Tetrahedrons and animated maps in 2d and 3d space. In Proc. 5th Int. Symp. on Spatial Data Handling, pages 63–71, 1992.

    Google Scholar 

  71. I.S. Kweon and T. Kanade. Extracting topographic terrain features from elevation maps. CVGIP: Image Understanding, 59:171–182, 1994.

    Google Scholar 

  72. G. Langran. Time in Geographic Information Systems. Taylor & Francis, London, 1992.

    Google Scholar 

  73. Robert Laurini and Derek Thompson. Fundamentals of Spatial Information Systems. Academic Press, Boston, MA, 1992.

    Google Scholar 

  74. D. T. Lee and B. J. Schachter. Two algorithms for constructing a Delaunay triangulation. Internat. J. Comput. Inform. Sci., 9:219–242, 1980.

    Google Scholar 

  75. J. Lee. Analyses of visibility sites on topographic surfaces. Internat. J. Geogr. Inform. Syst., 5:413–430, 1991.

    Google Scholar 

  76. J. Lee, P.K. Snyder, and P.F. Fisher. Modelling the effect of data errors on feature extraction from digital elevation models. Photogrammatic Engineering and Remote Sensing, 58:1461–1467, 1993.

    Google Scholar 

  77. Jay Lee. A drop heuristic conversion method for extracting irregular network for digital elevation models. In GIS/LIS '89 Proc., volume 1, pages 30–39. American Congress on Surveying and Mapping, November 1989.

    Google Scholar 

  78. Jay Lee. Comparison of existing methods for building triangular irregular network models of terrain from grid digital elevation models. Internat. J. Geogr. Inform. Syst., 5(3):267–285, July–September 1991.

    Google Scholar 

  79. Y. Livnat, H.-W. Shen, and C.R. Johnson. A near optimal isosurface extraction algorithm using the span space. IEEE Transactions on Visualization and Computer Graphics, 2:73–84, 1996.

    Google Scholar 

  80. D.R. Maidment. GIS and hydologic modeling. In M.F. Goodchild, B.O. Parks, and L.T. Steyaert, editors, Environmental Modeling with GIS, pages 147–167. Oxford University Press, New York, 1993.

    Google Scholar 

  81. H. G. Mairson and J. Stolfi. Reporting and counting intersections between two sets of line segments. In R. A. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD, volume 40 of NATO ASI Series F, pages 307–325. Springer-Verlag, Berlin, West Germany, 1988.

    Google Scholar 

  82. D.M. Mark. Automated detection of drainage networks from digital elevation models. Cartographica, 21:168–178, 1984.

    Google Scholar 

  83. E. M. McCreight. Priority search trees. SIAM J. Comput., 14:257–276, 1985.

    Google Scholar 

  84. A. M. J. Meijerink, H. A. M. de Brouwer, C. M. Mannaerts, and C. R. Valenzuela. Introduction to the Use of Geographic Information Systems for Practical Hydrology. Number 23 in ITC Publications. ITC, Enschede, 1994.

    Google Scholar 

  85. C. Mitchell. Terrain Evaluation. Longman, Harlow, 2nd edition, 1991.

    Google Scholar 

  86. J. S. B. Mitchell. An algorithmic approach to some problems in terrain navigation. Artif. Intell., 37:171–201, 1988.

    Google Scholar 

  87. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647–668, 1987.

    Google Scholar 

  88. Ernst P. Mücke, Isaac Saias, and Binhai Zhu. Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 274–283, 1996.

    Google Scholar 

  89. J. Nievergelt and F. P. Preparata. Plane-sweep algorithms for intersecting geometric figures. Commun. ACM, 25:739–747, 1982.

    Google Scholar 

  90. J.F. O'Callaghan and D.M. Mark. The extraction of drainage networks from digital elevation data. Computer Vision, Graphics, and Image Processing, 28:323–344, 1984.

    Google Scholar 

  91. J. O'Rourke. Computational Geometry in C. Cambridge Univ. Press, NY, 1994.

    Google Scholar 

  92. D. J. Pennock, B. J. Zebarth, and E. de Jong. Landform classification and soil distribution in hummocky terrain, Saskatchewan, Canada. Geoderma, 40:297–315, 1987.

    Google Scholar 

  93. T.K. Peucker. Data structures for digital terrain modules: Discussion and comparison. In Harvard Papers on Geographic Information Systems, volume 5. 1978.

    Google Scholar 

  94. T.K. Peucker and D.H. Douglas. Detection of surface-specific points by local parallel processing of discrete terrain elevation data. Computer Vision, Graphics, and Image Processing, 4:375–387, 1975.

    Google Scholar 

  95. T.K. Peucker, R.J. Fowler, J.J. Little, and D,M. Mark. The triangulated irregular network. In Proc. DTM Symp. Am. Soc, of Photogrammetry—Am. Congress on Survey and Mapping, pages 24–31, 1978.

    Google Scholar 

  96. J.L. Pfaltz. Surface networks. Geographical Analysis, 8:77–93, 1976.

    Google Scholar 

  97. F. P. Preparata and D. E. Muller. Finding the intersection of n half-spaces in time O(n log n). Theoret. Comput. Sci., 8:45–55, 1979.

    Google Scholar 

  98. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.

    Google Scholar 

  99. M. Sambridge, J. Braun, and H. McQueen. Geophysical parameterization and interpolation of irregular data using natural neighbours. Geophys. J. Int., 122:837–857, 1995.

    Google Scholar 

  100. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  101. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29:669–679, 1986.

    Google Scholar 

  102. L. Scarlatos. A compact terrain model based on critical topographic features. In Proc. Auto-Carto 9, pages 146–155, 1989.

    Google Scholar 

  103. Lori Scarlatos and Theo Pavlidis. Adaptive hierarchical triangulation. In Proc. 10th Internat. Sympos. Comput.-Assist. Cartog., volume 6 of Technical Papers 1991 ACSM-ASPRS Annual Convention, pages 234–246, 1991.

    Google Scholar 

  104. A.E. Scheidegger. Theoretical Geomorphology. Springer-Verlag, Berlin, 3rd edition, 1991.

    Google Scholar 

  105. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1:51–64, 1991.

    Google Scholar 

  106. R. Sibson. A brief description of natural neighbour interpolation. In Vic Barnet, editor, Interpreting Multivariate Data, pages 21–36. Wiley, Chichester, 1981.

    Google Scholar 

  107. A.T. Silfer, G.J. Kinn, and J.M. Hassett. A geographic information system utilizing the triangulated irregular network as a basis for hydrologic modeling. In Auto-Carto 8, pages 129–136, 1987.

    Google Scholar 

  108. C. Silva, J. S. B. Mitchell, and A. E. Kaufman. Automatic generation of triangular irregular networks using greedy cuts. In Visualization 95, pages 201–208, San Jose CA, 1995. IEEE Computer Society Press.

    Google Scholar 

  109. P. Sorensen and D. Lanter. Two algorithms for determining partial visibility and reducing data structure induced error in viewshed analysis. Photogrammatic Engineering and Remote Sensing, 28:1129–1132, 1993.

    Google Scholar 

  110. J.G. Speight. Parametric description of landform. In G.A. Stewart, editor, Land Evaluation Papers of a CSIRO Symposium, pages 239–250, 1968.

    Google Scholar 

  111. J. Star and J. Estes. Geographic Information Systems: an Introduction. Prentice Hall, Englewood Cliffs, 1990.

    Google Scholar 

  112. S. Takahashi, T. Ikeda, Y. Shinagawa, T.L. Kunii, and M. Ueda. Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data. In Eurographics'95, volume 14, pages C-181–C-192, 1995.

    Google Scholar 

  113. Y. A. Teng and L. S. Davies. Visibility analysis on digital terrain models and its parallel implementation. Technical Report CAR-TR-625, Center for Automation Research, University of Maryland, 1992.

    Google Scholar 

  114. D.M. Theobald and M.F. Goodchild. Artifacts of TIN-based surface flow modelling. In Proc. GIS/LIS, pages 955–964, 1990.

    Google Scholar 

  115. R. van Appelen. Drainage networks on TINS. Master's thesis, Department of Computer Science, Utrecht University, 1996.

    Google Scholar 

  116. J. van Bemmelen, W. Quak, M. van Hekken, and P. van Oosterom. Vector vs. raster-based algorithms for cross country movement planning. In Proc. Auto-Carto 11, pages 304–317, 1993.

    Google Scholar 

  117. M. van Kreveld. On quality paths in polyhedral terrains. In Proc. IGIS'94: Geographic Information Systems, volume 884 of Lecture Notes Comput. Sci., pages 113–122. Springer-Verlag, 1994.

    Google Scholar 

  118. M. van Kreveld. Efficient methods for isoline extraction from a TIN. Int. J. of GIS, 10:523–540, 1996.

    Google Scholar 

  119. M. van Kreveld. Variations on sweep algorithms: efficient computation of extended viewsheds and classifications. In Proc. 7th Int. Symp. on Spatial Data Handling, pages 13A.15–13A.27, 1996.

    Google Scholar 

  120. M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore. Contour trees and small seed sets for isosurface traversal. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 212–220, 1997.

    Google Scholar 

  121. A. Voigtmann, L. Becker, and K. Hinrichs. Hierarchical surface representations using constrained Delaunay triangulations. In Proc. 6th Int. Symp. on Spatial Data Handling, pages 848–867, 1994.

    Google Scholar 

  122. W. Warntz. The topology of a socio-economic terrain and spatial flow. Papers of the Regional Science Association, 17:47–61, 1966.

    Google Scholar 

  123. R. Webster and M. A. Oliver. Statistical Methods in Soil and Land Resource Survey. Oxford University Press, New York, 1990.

    Google Scholar 

  124. R. Weibel. An adaptive methodology for automated relief generalization. In Proc Auto-Carto 8, pages 42–49, 1987.

    Google Scholar 

  125. R. Weibel and M. Heller. Digital terrain modelling. In D. J. Maguire, M. F. Goodchild, and D. W. Rhind, editors, Geographical Information Systems — Principles and Applications, pages 269–297. Longman, London, 1991.

    Google Scholar 

  126. D. Wilcox and H. Moellering. Pass location to facilitate the direct extraction of Warntz networks from grid digital elevation models. In Proc. Auto-Carto 12, pages 22–31, 1995.

    Google Scholar 

  127. G.W. Wolf. Metric surface networks. In Proc. 4th Int. Symp. on Spatial Data Handling, pages 844–856, 1990.

    Google Scholar 

  128. M.F. Worboys. GIS: A Computing Perspective. Taylor & Francis, London, 1995.

    Google Scholar 

  129. S. Yu, M. van Kreveld, and J. Snoeyink. Drainage queries in TINS: from local to global and back again. In Proc. 7th Int. Symp. on Spatial Data Handling, pages 13A.1–13A.14, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Utrecht University, The Netherlands

    Marc van Kreveld

Authors
  1. Marc van Kreveld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc van Kreveld Jürg Nievergelt Thomas Roos Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

van Kreveld, M. (1997). Digital elevation models and TIN algorithms. In: van Kreveld, M., Nievergelt, J., Roos, T., Widmayer, P. (eds) Algorithmic Foundations of Geographic Information Systems. CISM School 1996. Lecture Notes in Computer Science, vol 1340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63818-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-63818-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63818-6

  • Online ISBN: 978-3-540-69653-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation