@inproceedings{vanGarderen2017-07-04Minim-39656,
  year={2017},
  doi={10.1111/cgf.13199},
  title={Minimum-Displacement Overlap Removal for Geo-referenced Data Visualization},
  number={36,3},
  issn={0167-7055},
  series={Computer Graphics Forum},
  booktitle={EuroVis 2017 Eurographics / IEEE VGTC Conference on Visualization 2017},
  pages={423--433},
  editor={Heer, Jeffrey},
  author={van Garderen, Mereke and Pampel, Barbara and Nocaj, Arlind and Brandes, Ulrik}
}

<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/39656">
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39656/1/vanGarderen_0-416243.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:title>Minimum-Displacement Overlap Removal for Geo-referenced Data Visualization</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">Given a set of rectangles embedded in the plane, we consider the problem of adjusting the layout to remove all overlap while preserving the orthogonal order of the rectangles. The objective is to minimize the displacement of the rectangles. We call this problem MINIMUM-DISPLACEMENT OVERLAP REMOVAL (MDOR). Our interest in this problem is motivated by the application of displaying metadata of archaeological sites. Because most existing overlap removal algorithms are not designed to minimize displacement while preserving orthogonal order, we present and compare several approaches which are tailored to our particular usecase. We introduce a new overlap removal heuristic which we call REARRANGE. Although conceptually simple, it is very effective in removing the overlap while keeping the displacement small. Furthermore, we propose an additional procedure to repair the orthogonal order after every iteration, with which we extend both our new heuristic and PRISM, a widely used overlap removal algorithm. We compare the performance of both approaches with and without this order repair method. The experimental results indicate that REARRANGE is very effective for heterogeneous input data where the overlap is concentrated in few dense regions.</dcterms:abstract>
    <dc:contributor>van Garderen, Mereke</dc:contributor>
    <dcterms:issued>2017-07-04</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-07-26T08:25:22Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Nocaj, Arlind</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Pampel, Barbara</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Nocaj, Arlind</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39656/1/vanGarderen_0-416243.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:creator>Pampel, Barbara</dc:creator>
    <dc:creator>van Garderen, Mereke</dc:creator>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39656"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-07-26T08:25:22Z</dc:date>
  </rdf:Description>
</rdf:RDF>