Publikation: Algorithms for Gradual Polyline Simplification
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Displaying line data is important in many visualization applications, and especially in the context of interactive geographical and cartographic visualization. When rendering linear features as roads, rivers or movement data on zoomable maps, the challenge is to display the data in an appropriate level of detail. A too detailed representation results in slow rendering and cluttered maps, while a too coarse representation might miss important data aspects. In this paper, we propose the gradual line simplification (GLS) problem, which aims to compute a fine-grained succession of consistent simplifications of a given input polyline with certain quality guarantees. The core concept of gradual simplification is to iteratively remove points from the polyline to obtain increasingly coarser representations. We devise two objective functions to guide this simplification process and present dynamic programs that compute the optimal solutions in 𝒪(n³) for an input line with n points. For practical application to large inputs, we also devise significantly faster greedy algorithms that provide constant factor guarantees for both problem variants at once. In an extensive experimental study on real-world data, we demonstrate that our algorithms are capable of producing simplification sequences of high quality within milliseconds on polylines consisting of over half a million points.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
KRUMBHOLZ, Nick, Stefan FUNKE, Peter SCHÄFER, Sabine STORANDT, 2024. Algorithms for Gradual Polyline Simplification. 22nd International Symposium on Experimental Algorithms (SEA 2024). Vienna, Austria, 23. Juli 2024 - 26. Juli 2024. In: LIBERTI, Leo, Hrsg.. 22nd International Symposium on Experimental Algorithms (SEA 2024). Wadern: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2024, 19. Leibniz International Proceedings in Informatics (LIPIcs). 301. eISSN 1868-8969. ISBN 978-3-95977-325-6. Verfügbar unter: doi: 10.4230/LIPIcs.SEA.2024.19BibTex
@inproceedings{Krumbholz2024Algor-71377, year={2024}, doi={10.4230/LIPIcs.SEA.2024.19}, title={Algorithms for Gradual Polyline Simplification}, number={301}, isbn={978-3-95977-325-6}, publisher={Schloss Dagstuhl, Leibniz-Zentrum für Informatik}, address={Wadern}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, booktitle={22nd International Symposium on Experimental Algorithms (SEA 2024)}, editor={Liberti, Leo}, author={Krumbholz, Nick and Funke, Stefan and Schäfer, Peter and Storandt, Sabine}, note={Article Number: 19} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/71377"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:title>Algorithms for Gradual Polyline Simplification</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Funke, Stefan</dc:creator> <dc:contributor>Schäfer, Peter</dc:contributor> <dc:creator>Storandt, Sabine</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/71377"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/71377/4/Krumbholz_2-kbd4mdiqgz1m8.pdf"/> <dc:creator>Krumbholz, Nick</dc:creator> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/71377/4/Krumbholz_2-kbd4mdiqgz1m8.pdf"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-11-21T11:08:02Z</dc:date> <dcterms:abstract>Displaying line data is important in many visualization applications, and especially in the context of interactive geographical and cartographic visualization. When rendering linear features as roads, rivers or movement data on zoomable maps, the challenge is to display the data in an appropriate level of detail. A too detailed representation results in slow rendering and cluttered maps, while a too coarse representation might miss important data aspects. In this paper, we propose the gradual line simplification (GLS) problem, which aims to compute a fine-grained succession of consistent simplifications of a given input polyline with certain quality guarantees. The core concept of gradual simplification is to iteratively remove points from the polyline to obtain increasingly coarser representations. We devise two objective functions to guide this simplification process and present dynamic programs that compute the optimal solutions in 𝒪(n³) for an input line with n points. For practical application to large inputs, we also devise significantly faster greedy algorithms that provide constant factor guarantees for both problem variants at once. In an extensive experimental study on real-world data, we demonstrate that our algorithms are capable of producing simplification sequences of high quality within milliseconds on polylines consisting of over half a million points.</dcterms:abstract> <dcterms:issued>2024</dcterms:issued> <dc:contributor>Storandt, Sabine</dc:contributor> <dc:contributor>Funke, Stefan</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-11-21T11:08:02Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Krumbholz, Nick</dc:contributor> <dc:creator>Schäfer, Peter</dc:creator> </rdf:Description> </rdf:RDF>