Article

Applying layout algorithms to hand-drawn graphs

Authors:

Peter Reid,

Fred Hallett-Hook,

Beryl Plimmer,

Helen PurchaseAuthors Info & Claims

OZCHI '07: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces

Pages 203 - 206

https://doi.org/10.1145/1324892.1324933

Published: 28 November 2007 Publication History

Get Access

Abstract

Hand-drawing a node-and-edge graph is a simple visual problem solving technique; however as the graph is built it can easily get untidy and confusing. It is more difficult to understand and interpret a confusing graph. By applying edge morphing techniques and a force-directed algorithm the hand-drawn graph can retain its informal appearance while its layout is improved. Graphs will be more readily understood, making the problem solving process easier.

References

[1]

Arvo, J., Novins, K., Appearance-preserving manipulation of hand-drawn graphs, in proc Graphite, ACM, 61--68 (2006)

Digital Library

Google Scholar

[2]

Freeman, I., Plimmer, B., Edge Semantics for Sketched Diagram Recognition, in proc AUIC, ACM, 71--78 (2007)

Digital Library

Google Scholar

[3]

Fruchterman, M. J. T., Reingold, M. E., Graph drawing by force-directed placement, Softw. Pract. Exper., 21, 11, 1129--1164, (1991)

Digital Library

Google Scholar

[4]

Patel, R., Plimmer, B., Grundy, J., Ihaka, R., Exploring Better Techniques for Diagram Recognition, NZ Computer Science Student Conference, (2007),

Google Scholar

[5]

Purchase, H. C., Which aesthetic has the greatest effect on human understanding?, in proc Graph Drawing Symposium, (1997)

Digital Library

Google Scholar

[6]

Purchase, H. C., Carrington, D. A. and Allder J-A., Empirical evaluation of aesthetics-based graph layout, Empirical Software Engineering, 7, 3, 233--255 (2002)

Digital Library

Google Scholar

[7]

Ware, C., Purchase, H. C., Colpoys, L. and McGill, M., Cognitive Measurements of Graph Aesthetics, Information Visualization, 1, 2, 103--110 (2002)

Digital Library

Google Scholar

[8]

Yeung, L. W. S., Exploring beautification and the effects of designs' level of formality on the design performance during the early stages of the design process Department of Psychology, MSc, University of Auckland, (2007),

Google Scholar

Cited By

View all

Miller TSturdee MPrince D(2023)Exploring the Representation of Cyber-Risk Data Through Sketching2023 IEEE Symposium on Visualization for Cyber Security (VizSec)10.1109/VizSec60606.2023.00010(22-32)Online publication date: 25-Oct-2023
https://doi.org/10.1109/VizSec60606.2023.00010
Sutherland CLuxton-Reilly APlimmer B(2016)Who changed my annotation? An investigation into refitting freeform ink annotations2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)10.1109/VLHCC.2016.7739658(12-20)Online publication date: Sep-2016
https://doi.org/10.1109/VLHCC.2016.7739658
Walny JHuron SCarpendale S(2015)An Exploratory Study of Data Sketching for Visual RepresentationComputer Graphics Forum10.5555/2858877.285890234:3(231-240)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.5555/2858877.2858902
Show More Cited By

Index Terms

Applying layout algorithms to hand-drawn graphs
1. Human-centered computing
  1. Human computer interaction (HCI)

Recommendations

Layout of Graphs with Bounded Tree-Width

A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues , such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number . A ...
Algorithms for GA-H reduced graphs

Let GA be a hereditary family of graphs and H a hereditary family of acyclically directed family of graphs. A graph G ( V , E ) is a GA-Hreduced graph if it can be obtained from a graph GA ( V , D ) GA by deleting the edges of an edge subgraph H ( V , E ...
Appearance-preserving manipulation of hand-drawn graphs
GRAPHITE '05: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia

We describe a sketching system that allows users to create and manipulate directed graphs, such as those depicting state diagrams, using pen-input alone. The system exactly preserves the user's strokes, which may be entered in any order, and depicts ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

OZCHI '07: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces

November 2007

323 pages

ISBN:9781595938725

DOI:10.1145/1324892

Conference Chair:
Bruce Thomas
University of South Australia
,
Program Chair:
Mark Billinghurst
University of Canterbury

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 November 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

OZCHI '07

Sponsor:

DSTO

OZCHI '07: Proceedings of the 19th conference of the computer-human interaction special interest group of Australia on Computer-human interaction: design

November 28 - 30, 2007

Adelaide, Australia

Acceptance Rates

OZCHI '07 Paper Acceptance Rate 26 of 42 submissions, 62%;

Overall Acceptance Rate 362 of 729 submissions, 50%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
240
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Miller TSturdee MPrince D(2023)Exploring the Representation of Cyber-Risk Data Through Sketching2023 IEEE Symposium on Visualization for Cyber Security (VizSec)10.1109/VizSec60606.2023.00010(22-32)Online publication date: 25-Oct-2023
https://doi.org/10.1109/VizSec60606.2023.00010
Sutherland CLuxton-Reilly APlimmer B(2016)Who changed my annotation? An investigation into refitting freeform ink annotations2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)10.1109/VLHCC.2016.7739658(12-20)Online publication date: Sep-2016
https://doi.org/10.1109/VLHCC.2016.7739658
Walny JHuron SCarpendale S(2015)An Exploratory Study of Data Sketching for Visual RepresentationComputer Graphics Forum10.5555/2858877.285890234:3(231-240)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.5555/2858877.2858902
Walny JHuron SCarpendale S(2015)An Exploratory Study of Data Sketching for Visual RepresentationComputer Graphics Forum10.1111/cgf.1263534:3(231-240)Online publication date: 20-Jul-2015
https://doi.org/10.1111/cgf.12635
Purchase HPlimmer BBaker RPilcher C(2010)Graph drawing aesthetics in user-sketched graph layoutsProceedings of the Eleventh Australasian Conference on User Interface - Volume 10610.5555/1862280.1862292(80-88)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1862280.1862292
Plimmer BPurchase HYang HBrereton MViller SKraal B(2010)SketchNodeProceedings of the 22nd Conference of the Computer-Human Interaction Special Interest Group of Australia on Computer-Human Interaction10.1145/1952222.1952249(136-143)Online publication date: 22-Nov-2010
https://dl.acm.org/doi/10.1145/1952222.1952249

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Layout of Graphs with Bounded Tree-Width

Algorithms for GA-H reduced graphs

Appearance-preserving manipulation of hand-drawn graphs