Abstract
We present a simple, efficient and practical algorithm for constructing and subsequently simplifying contour maps from massive high-resolution DEMs, under some practically realistic assumptions on the DEM and contours.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
TPIE - Templated Portable I/O-Environment, http://madalgo.au.dk/tpie
Agarwal, P., Arge, L., Mølhave, T., Sadri, B.: I/O-efficient algorithms for computing contours on a terrain. In: Proc. Symposium on Computational Geometry, pp. 129–138 (2008)
Agarwal, P.K., Arge, L., Murali, T.M., Varadarajan, K., Vitter, J.S.: I/O-efficient algorithms for contour line extraction and planar graph blocking. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 117–126 (1998)
Agarwal, P.K., Arge, L., Yi, K.: I/O-efficient batched union-find and its applications to terrain analysis. ACM Trans. Algorithms 7(1), 11:1–11:21 (2010)
Aggarwal, A., Vitter, S., Jeffrey: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–358 (2002)
Arge, L., Larsen, K., Mølhave, T., van Walderveen, F.: Cleaning massive sonar point clouds. In: Proc ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, pp. 152–161 (2010)
Cabello, S., Liu, Y., Mantler, A., Snoeyink, J.: Testing homotopy for paths in the plane. In: Proc. Symposium on Computational Geometry, pp. 160–169 (2002)
Carr, H., Snoeyink, J., van de Panne, M.: Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. In: Computational Geometry, pp. 42–58 (2010) (Special Issue on the 14th Annual Fall Workshop)
Danner, A., Mølhave, T., Yi, K., Agarwal, P., Arge, L., Mitasova, H.: TerraStream: From elevation data to watershed hierarchies. In: Proc. ACM International Symposium on Advances in Geographic Information Systems, pp. 28:1–28:8 (2007)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry – Algorithms and Applications (1997)
de Berg, M., van Kreveld, M., Schirra, S.: A new approach to subdivision simplification. In: Proc. 12th Internat. Sympos. Comput.-Assist. Cartog., pp. 79–88 (1995)
Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature (1973)
Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 454–463 (2000)
Garland, M., Heckbert, P.: Surface simplification using quadric error metrics. In: Proc. Computer Graphics and Interactive Techniques, pp. 209–216 (1997)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD International Conference on Management of Data, pp. 47–57 (1984)
Heckbert, P.S., Garland, M.: Survey of polygonal surface simplification algorithms. Technical report, CS Dept., Carnegie Mellon U (to appear)
Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl, 63–97 (1994)
Saalfeld, A.: Topologically consistent line simplification with the douglas peucker algorithm. In: Geographic Information Science (1999)
Vitter, J.: External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 209–271 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arge, L., Deleuran, L., Mølhave, T., Revsbæk, M., Truelsen, J. (2012). Simplifying Massive Contour Maps. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)