Computational and human evaluations of orthogonal graph drawings

Mirza, IB; Huang, W; Georgakopoulos, D; Liu, H

Computational and human evaluations of orthogonal graph drawings

Mirza, IB Huang, W

Georgakopoulos, D Liu, H

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 2019 23rd International Conference in Information Visualization - Part II, IV-2 2019, 2019, pp. 74 - 77
Issue Date:: 2019-07-01

Closed Access

	Filename	Description	Size
	08811939.pdf	Published version	108.13 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mirza, IB	en_US
dc.contributor.author	Huang, W https://orcid.org/0000-0002-5190-7839	en_US
dc.contributor.author	Georgakopoulos, D	en_US
dc.contributor.author	Liu, H	en_US
dc.date.issued	2019-07-01	en_US
dc.identifier.citation	Proceedings - 2019 23rd International Conference in Information Visualization - Part II, IV-2 2019, 2019, pp. 74 - 77	en_US
dc.identifier.isbn	9781728128504	en_US
dc.identifier.uri	http://hdl.handle.net/10453/138798
dc.description.abstract	© 2019 IEEE. Graphs are often drawn into straight-line node-link diagrams for better understanding of the underlying data. However, curves have also been used in graph visualization for various purposes. Orthogonal drawing is one type of graph drawings in which each edge is made up with an alternating sequence of vertical and horizontal line segments. In the past, many algorithms have been developed for orthogonal drawing so that the resulting drawings meet some pre-defined aesthetic criteria and constraints. Experiments have also been conducted to evaluate performance of algorithms and effectiveness of orthogonal drawings. In this paper, we briefly summarize the research that has been done in relation to orthogonal drawing and provide directions for future research.	en_US
dc.relation.ispartof	Proceedings - 2019 23rd International Conference in Information Visualization - Part II, IV-2 2019	en_US
dc.relation.isbasedon	10.1109/IV-2.2019.00023	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Computational and human evaluations of orthogonal graph drawings	en_US
dc.type	Conference Proceeding
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Transdisciplinary Innovation
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

© 2019 IEEE. Graphs are often drawn into straight-line node-link diagrams for better understanding of the underlying data. However, curves have also been used in graph visualization for various purposes. Orthogonal drawing is one type of graph drawings in which each edge is made up with an alternating sequence of vertical and horizontal line segments. In the past, many algorithms have been developed for orthogonal drawing so that the resulting drawings meet some pre-defined aesthetic criteria and constraints. Experiments have also been conducted to evaluate performance of algorithms and effectiveness of orthogonal drawings. In this paper, we briefly summarize the research that has been done in relation to orthogonal drawing and provide directions for future research.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/138798