KOPS - Das Institutionelle Repositorium der Universität Konstanz

The Gridfit Algorithm : An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data

The Gridfit Algorithm : An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1d98dcb7de74d7982bb71051e39e2fa5

KEIM, Daniel A., Annemarie HERRMANN, 1998. The Gridfit Algorithm : An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data. Visualization '98. Research Triangle Park, NC, USA. In: Proceedings Visualization '98 (Cat. No.98CB36276). Visualization '98. Research Triangle Park, NC, USA. IEEE, pp. 181-188,. ISBN 0-8186-9176-X. Available under: doi: 10.1109/VISUAL.1998.745301

@inproceedings{Keim1998Gridf-5904, title={The Gridfit Algorithm : An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data}, year={1998}, doi={10.1109/VISUAL.1998.745301}, isbn={0-8186-9176-X}, publisher={IEEE}, booktitle={Proceedings Visualization '98 (Cat. No.98CB36276)}, pages={181--188,}, author={Keim, Daniel A. and Herrmann, Annemarie} }

<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/rdf/resource/123456789/5904"> <dc:contributor>Keim, Daniel A.</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5904/1/The_Gridfit_Algorithm.pdf"/> <dcterms:issued>1998</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:17Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:abstract xml:lang="eng">In a large number of applications, data is collected and referenced by their spatial location. Visualizing large amounts of spatially referenced data on a limited-size display often results in poor visualizations due to the high degree of overplotting of neighboring data points. In this paper, we introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on (1) placing overlapping data points on the nearest unoccupied pixel and (2) shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness, and show the superiority of the Gridfit approach. For measuring the effectiveness, in addition to comparing the resulting visualizations we introduce mathematical effectiveness criteria measuring properties of the generated visualizations such as distance- and positionpreservation.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5904/1/The_Gridfit_Algorithm.pdf"/> <dc:contributor>Herrmann, Annemarie</dc:contributor> <dc:format>application/pdf</dc:format> <dc:creator>Keim, Daniel A.</dc:creator> <dc:creator>Herrmann, Annemarie</dc:creator> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:bibliographicCitation>First publ. in (rev. version): Proceedings Visualization '98, October 18 - 23, 1998, Research Triangle Park, North Carolina / Ed. by David Ebert ... New York: Association for Computing Machinery, 1998, pp. 181-188</dcterms:bibliographicCitation> <dc:rights>deposit-license</dc:rights> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:17Z</dc:date> <dcterms:title>The Gridfit Algorithm : An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data</dcterms:title> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5904"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

The_Gridfit_Algorithm.pdf 170

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto