Simplifying massive contour maps

Authors:
Lars Arge;Lasse Deleuran;Thomas Mølhave;Morten Revsbæk;Jakob Truelsen
Affiliations:
MADALGO, Department of Computer Science, Aarhus University, Denmark;MADALGO, Department of Computer Science, Aarhus University, Denmark;Department of Computer Science, Duke University;MADALGO, Department of Computer Science, Aarhus University, Denmark;SCALGO, Scalable Algorithmics, Denmark
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 15
Cited 0

The input/output complexity of sorting and related problems

Communications of the ACM
Computing minimum length paths of a given homotopy class

Computational Geometry: Theory and Applications
Surface simplification using quadric error metrics

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
I/O-efficient algorithms for contour-line extraction and planar graph blocking

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Testing Homotopy for paths in the plane

Proceedings of the eighteenth annual symposium on Computational geometry
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
External memory data structures

Handbook of massive data sets
Topological persistence and simplification

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
TerraStream: from elevation data to watershed hierarchies

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
I/o-efficient efficient algorithms for computing contours on a terrain

Proceedings of the twenty-fourth annual symposium on Computational geometry
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

Computational Geometry: Theory and Applications
I/O-efficient batched union-find and its applications to terrain analysis

ACM Transactions on Algorithms (TALG)
Cleaning massive sonar point clouds

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

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.