Experimental Analysis of the Accessibility of Drawings with Few Segments

The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segme...

Full description

Saved in:
Bibliographic Details
Published in:Journal of graph algorithms and applications 2018-09, Vol.22 (3), p.501-518
Main Authors: Kindermann, Philipp, Meulemans, Wouter, Schulz, André
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c1124-5951fa649b7fd235c88aced4953a1c57541c7e0fa7fbbea3839d051a862d5b9d3
cites
container_end_page 518
container_issue 3
container_start_page 501
container_title Journal of graph algorithms and applications
container_volume 22
creator Kindermann, Philipp
Meulemans, Wouter
Schulz, André
description The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segments have a better aesthetic appeal and help the user to assess the underlying graph. We design a user study that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the participants to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.
doi_str_mv 10.7155/jgaa.00474
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_7155_jgaa_00474</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_7155_jgaa_00474</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1124-5951fa649b7fd235c88aced4953a1c57541c7e0fa7fbbea3839d051a862d5b9d3</originalsourceid><addsrcrecordid>eNpNkE1Lw0AYhBdRsFYv_oI9C6n77kc2ewy1H0Khh-o5vNnspltiWrKBmH-vUQ-eZhiYYXgIeQS20KDU86lGXDAmtbwiM1A8TUCDuf7nb8ldjCfGuOA6m5Ht6vPiuvDh2h4bmrfYjDFEeva0PzqaW-tiDGVoQj9O4UuHQ2jrSIfQH-naDfTg6qkc78mNxya6hz-dk_f16m25TXb7zesy3yUWgMtEGQUeU2lK7SsulM0ytK6SRgkEq7SSYLVjHrUvS4ciE6ZiCjBLeaVKU4k5efrdtd05xs754vJ9H7uxAFZMDIqJQfHDQHwBNyNP9Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Experimental Analysis of the Accessibility of Drawings with Few Segments</title><source>Directory of Open Journals (DOAJ)</source><creator>Kindermann, Philipp ; Meulemans, Wouter ; Schulz, André</creator><creatorcontrib>Kindermann, Philipp ; Meulemans, Wouter ; Schulz, André</creatorcontrib><description>The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segments have a better aesthetic appeal and help the user to assess the underlying graph. We design a user study that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the participants to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.</description><identifier>ISSN: 1526-1719</identifier><identifier>EISSN: 1526-1719</identifier><identifier>DOI: 10.7155/jgaa.00474</identifier><language>eng</language><ispartof>Journal of graph algorithms and applications, 2018-09, Vol.22 (3), p.501-518</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1124-5951fa649b7fd235c88aced4953a1c57541c7e0fa7fbbea3839d051a862d5b9d3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,860,27903,27904</link.rule.ids></links><search><creatorcontrib>Kindermann, Philipp</creatorcontrib><creatorcontrib>Meulemans, Wouter</creatorcontrib><creatorcontrib>Schulz, André</creatorcontrib><title>Experimental Analysis of the Accessibility of Drawings with Few Segments</title><title>Journal of graph algorithms and applications</title><description>The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segments have a better aesthetic appeal and help the user to assess the underlying graph. We design a user study that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the participants to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.</description><issn>1526-1719</issn><issn>1526-1719</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNpNkE1Lw0AYhBdRsFYv_oI9C6n77kc2ewy1H0Khh-o5vNnspltiWrKBmH-vUQ-eZhiYYXgIeQS20KDU86lGXDAmtbwiM1A8TUCDuf7nb8ldjCfGuOA6m5Ht6vPiuvDh2h4bmrfYjDFEeva0PzqaW-tiDGVoQj9O4UuHQ2jrSIfQH-naDfTg6qkc78mNxya6hz-dk_f16m25TXb7zesy3yUWgMtEGQUeU2lK7SsulM0ytK6SRgkEq7SSYLVjHrUvS4ciE6ZiCjBLeaVKU4k5efrdtd05xs754vJ9H7uxAFZMDIqJQfHDQHwBNyNP9Q</recordid><startdate>20180901</startdate><enddate>20180901</enddate><creator>Kindermann, Philipp</creator><creator>Meulemans, Wouter</creator><creator>Schulz, André</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20180901</creationdate><title>Experimental Analysis of the Accessibility of Drawings with Few Segments</title><author>Kindermann, Philipp ; Meulemans, Wouter ; Schulz, André</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1124-5951fa649b7fd235c88aced4953a1c57541c7e0fa7fbbea3839d051a862d5b9d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kindermann, Philipp</creatorcontrib><creatorcontrib>Meulemans, Wouter</creatorcontrib><creatorcontrib>Schulz, André</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of graph algorithms and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kindermann, Philipp</au><au>Meulemans, Wouter</au><au>Schulz, André</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Experimental Analysis of the Accessibility of Drawings with Few Segments</atitle><jtitle>Journal of graph algorithms and applications</jtitle><date>2018-09-01</date><risdate>2018</risdate><volume>22</volume><issue>3</issue><spage>501</spage><epage>518</epage><pages>501-518</pages><issn>1526-1719</issn><eissn>1526-1719</eissn><abstract>The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segments have a better aesthetic appeal and help the user to assess the underlying graph. We design a user study that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the participants to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.</abstract><doi>10.7155/jgaa.00474</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1526-1719
ispartof Journal of graph algorithms and applications, 2018-09, Vol.22 (3), p.501-518
issn 1526-1719
1526-1719
language eng
recordid cdi_crossref_primary_10_7155_jgaa_00474
source Directory of Open Journals (DOAJ)
title Experimental Analysis of the Accessibility of Drawings with Few Segments
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T12%3A55%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Experimental%20Analysis%20of%20the%20Accessibility%20of%20Drawings%20with%20Few%20Segments&rft.jtitle=Journal%20of%20graph%20algorithms%20and%20applications&rft.au=Kindermann,%20Philipp&rft.date=2018-09-01&rft.volume=22&rft.issue=3&rft.spage=501&rft.epage=518&rft.pages=501-518&rft.issn=1526-1719&rft.eissn=1526-1719&rft_id=info:doi/10.7155/jgaa.00474&rft_dat=%3Ccrossref%3E10_7155_jgaa_00474%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1124-5951fa649b7fd235c88aced4953a1c57541c7e0fa7fbbea3839d051a862d5b9d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true