Simplifying Massive Contour Maps

Lars Arge; Lasse Kosetski Deleuran; Thomas Mølhave; Morten Revsbæk; Jakob Truelsen

doi:10.1007/978-3-642-33090-2_10

Simplifying Massive Contour Maps

Lars Arge
, Lasse Kosetski Deleuran
, Thomas Mølhave
, Morten Revsbæk
, Jakob Truelsen

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Conference article › Research › peer-review

7 Citations (Scopus)

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.

Original language	English
Book series	Lecture Notes in Computer Science
Volume	7501
Pages (from-to)	96-107
Number of pages	12
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-33090-2_10
Publication status	Published - 2012
Event	Annual European Symposium Algorithms - Ljubljana, Slovenia Duration: 10 Sept 2012 → 12 Dec 2012 Conference number: 20

Conference

Conference	Annual European Symposium Algorithms
Number	20
Country/Territory	Slovenia
City	Ljubljana
Period	10/09/2012 → 12/12/2012

Access to Document

10.1007/978-3-642-33090-2_10

Library access?

Check availability with the Royal Danish Library

Cite this

@inproceedings{4102b3819e6b4eca89b9ed64b5c927bf,

title = "Simplifying Massive Contour Maps",

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.",

author = "Lars Arge and Deleuran, \{Lasse Kosetski\} and Thomas M{\o}lhave and Morten Revsb{\ae}k and Jakob Truelsen",

note = "Title of the vol.: Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / ed. by Leah Epstein, Paolo Ferragina. ISBN: 978-3-642-33089-6, 978-3-642-33090-2; Annual European Symposium Algorithms, ESA ; Conference date: 10-09-2012 Through 12-12-2012",

year = "2012",

doi = "10.1007/978-3-642-33090-2\_10",

language = "English",

volume = "7501",

pages = "96--107",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - GEN

T1 - Simplifying Massive Contour Maps

AU - Arge, Lars

AU - Deleuran, Lasse Kosetski

AU - Mølhave, Thomas

AU - Revsbæk, Morten

AU - Truelsen, Jakob

N1 - Conference code: 20

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-33090-2_10

DO - 10.1007/978-3-642-33090-2_10

M3 - Conference article

SN - 0302-9743

VL - 7501

SP - 96

EP - 107

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Annual European Symposium Algorithms

Y2 - 10 September 2012 through 12 December 2012

ER -

Simplifying Massive Contour Maps

Abstract

Conference

Access to Document

Library access?

Fingerprint

Cite this