Sketch-Driven Orthogonal Graph Drawing

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:b0569da41f718d05993b96982132822a

BRANDES, Ulrik, Markus EIGLSPERGER, Michael KAUFMANN, Dorothea WAGNER, 2002. Sketch-Driven Orthogonal Graph Drawing. In: GOODRICH, Michael T., ed., Stephen G. KOBOUROV, ed.. Graph Drawing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 1-11. ISBN 978-3-540-00158-4. Available under: doi: 10.1007/3-540-36151-0_1

@inproceedings{Brandes2002-11-08Sketc-5879, title={Sketch-Driven Orthogonal Graph Drawing}, year={2002}, doi={10.1007/3-540-36151-0_1}, number={2528}, isbn={978-3-540-00158-4}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing}, pages={1--11}, editor={Goodrich, Michael T. and Kobourov, Stephen G.}, author={Brandes, Ulrik and Eiglsperger, Markus and Kaufmann, Michael and Wagner, Dorothea} }

<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/5879"> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:title>Sketch-Driven Orthogonal Graph Drawing</dcterms:title> <dc:contributor>Eiglsperger, Markus</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dc:date> <dcterms:issued>2002-11-08</dcterms:issued> <dcterms:abstract xml:lang="eng">We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal graph drawing.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5879/1/proceedings.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:rights>deposit-license</dc:rights> <dc:creator>Wagner, Dorothea</dc:creator> <dc:format>application/pdf</dc:format> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:language>deu</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Kaufmann, Michael</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5879"/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Eiglsperger, Markus</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Kaufmann, Michael</dc:contributor> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 10th International Symposium on Graph Drawing (GD´02) (LNCS 2528), 2002, pp. 1-11</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5879/1/proceedings.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:56Z</dcterms:available> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

proceedings.pdf 187

Das Dokument erscheint in:

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

KOPS Suche


Stöbern

Mein Benutzerkonto