No Cover Image

Journal article 1142 views

ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges

Paolo Simonetto, Daniel Archambault Orcid Logo, David Auber, Romain Bourqui

Computer Graphics Forum (EuroVis 2011), Volume: 30, Issue: 3, Pages: 1071 - 1080

Swansea University Author: Daniel Archambault Orcid Logo

Full text not available from this repository: check for access using links below.

Published in: Computer Graphics Forum (EuroVis 2011)
ISSN: 0167-7055
Published: 2011
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa13914
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T12:11:19Z
last_indexed 2018-02-09T04:44:58Z
id cronfa13914
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-09-11T10:55:49.2753103</datestamp><bib-version>v2</bib-version><id>13914</id><entry>2013-01-18</entry><title>ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges</title><swanseaauthors><author><sid>8fa6987716a22304ef04d3c3d50ef266</sid><ORCID>0000-0003-4978-8479</ORCID><firstname>Daniel</firstname><surname>Archambault</surname><name>Daniel Archambault</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2013-01-18</date><deptcode>SCS</deptcode><abstract></abstract><type>Journal Article</type><journal>Computer Graphics Forum (EuroVis 2011)</journal><volume>30</volume><journalNumber>3</journalNumber><paginationStart>1071</paginationStart><paginationEnd>1080</paginationEnd><publisher/><issnPrint>0167-7055</issnPrint><issnElectronic/><keywords/><publishedDay>30</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2011</publishedYear><publishedDate>2011-06-30</publishedDate><doi>10.1111/j.1467-8659.2011.01956.x</doi><url/><notes></notes><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-09-11T10:55:49.2753103</lastEdited><Created>2013-01-18T13:34:54.7110180</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Paolo</firstname><surname>Simonetto</surname><order>1</order></author><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>2</order></author><author><firstname>David</firstname><surname>Auber</surname><order>3</order></author><author><firstname>Romain</firstname><surname>Bourqui</surname><order>4</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-09-11T10:55:49.2753103 v2 13914 2013-01-18 ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2013-01-18 SCS Journal Article Computer Graphics Forum (EuroVis 2011) 30 3 1071 1080 0167-7055 30 6 2011 2011-06-30 10.1111/j.1467-8659.2011.01956.x COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-09-11T10:55:49.2753103 2013-01-18T13:34:54.7110180 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Paolo Simonetto 1 Daniel Archambault 0000-0003-4978-8479 2 David Auber 3 Romain Bourqui 4
title ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
spellingShingle ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
Daniel Archambault
title_short ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
title_full ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
title_fullStr ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
title_full_unstemmed ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
title_sort ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
author_id_str_mv 8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv 8fa6987716a22304ef04d3c3d50ef266_***_Daniel Archambault
author Daniel Archambault
author2 Paolo Simonetto
Daniel Archambault
David Auber
Romain Bourqui
format Journal article
container_title Computer Graphics Forum (EuroVis 2011)
container_volume 30
container_issue 3
container_start_page 1071
publishDate 2011
institution Swansea University
issn 0167-7055
doi_str_mv 10.1111/j.1467-8659.2011.01956.x
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
published_date 2011-06-30T03:15:55Z
_version_ 1763750293046034432
score 11.016235