Topology Preserving Constrained Graph Layout. Dwyer, T., Marriott, K., & Wybrow, M. In Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Nierstrasz, O., Pandu Rangan, C., Steffen, B., Sudan, M., Terzopoulos, D., Tygar, D., Vardi, M. Y., Weikum, G., Tollis, I. G., & Patrignani, M., editors, Graph Drawing, volume 5417, pages 230–241. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009. ![Topology Preserving Constrained Graph Layout [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.
@incollection{hutchison_topology_2009,
address = {Berlin, Heidelberg},
title = {Topology {Preserving} {Constrained} {Graph} {Layout}},
volume = {5417},
isbn = {978-3-642-00218-2 978-3-642-00219-9},
url = {http://link.springer.com/10.1007/978-3-642-00219-9_22},
abstract = {Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.},
language = {en},
urldate = {2018-07-11},
booktitle = {Graph {Drawing}},
publisher = {Springer Berlin Heidelberg},
author = {Dwyer, Tim and Marriott, Kim and Wybrow, Michael},
editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Tollis, Ioannis G. and Patrignani, Maurizio},
year = {2009},
doi = {10.1007/978-3-642-00219-9_22},
pages = {230--241},
}
Downloads: 0
{"_id":"NYQNxTQTGkMFdQgBo","bibbaseid":"dwyer-marriott-wybrow-topologypreservingconstrainedgraphlayout-2009","downloads":0,"creationDate":"2018-10-24T17:51:30.932Z","title":"Topology Preserving Constrained Graph Layout","author_short":["Dwyer, T.","Marriott, K.","Wybrow, M."],"year":2009,"bibtype":"incollection","biburl":"https://api.zotero.org/users/5027874/collections/5J22C4SQ/items?key=jTwdgElQWhjcMRHiEIu3V8oa&format=bibtex&limit=100","bibdata":{"bibtype":"incollection","type":"incollection","address":"Berlin, Heidelberg","title":"Topology Preserving Constrained Graph Layout","volume":"5417","isbn":"978-3-642-00218-2 978-3-642-00219-9","url":"http://link.springer.com/10.1007/978-3-642-00219-9_22","abstract":"Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.","language":"en","urldate":"2018-07-11","booktitle":"Graph Drawing","publisher":"Springer Berlin Heidelberg","author":[{"propositions":[],"lastnames":["Dwyer"],"firstnames":["Tim"],"suffixes":[]},{"propositions":[],"lastnames":["Marriott"],"firstnames":["Kim"],"suffixes":[]},{"propositions":[],"lastnames":["Wybrow"],"firstnames":["Michael"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Hutchison"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Kanade"],"firstnames":["Takeo"],"suffixes":[]},{"propositions":[],"lastnames":["Kittler"],"firstnames":["Josef"],"suffixes":[]},{"propositions":[],"lastnames":["Kleinberg"],"firstnames":["Jon","M."],"suffixes":[]},{"propositions":[],"lastnames":["Mattern"],"firstnames":["Friedemann"],"suffixes":[]},{"propositions":[],"lastnames":["Mitchell"],"firstnames":["John","C."],"suffixes":[]},{"propositions":[],"lastnames":["Naor"],"firstnames":["Moni"],"suffixes":[]},{"propositions":[],"lastnames":["Nierstrasz"],"firstnames":["Oscar"],"suffixes":[]},{"propositions":[],"lastnames":["Pandu","Rangan"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Steffen"],"firstnames":["Bernhard"],"suffixes":[]},{"propositions":[],"lastnames":["Sudan"],"firstnames":["Madhu"],"suffixes":[]},{"propositions":[],"lastnames":["Terzopoulos"],"firstnames":["Demetri"],"suffixes":[]},{"propositions":[],"lastnames":["Tygar"],"firstnames":["Doug"],"suffixes":[]},{"propositions":[],"lastnames":["Vardi"],"firstnames":["Moshe","Y."],"suffixes":[]},{"propositions":[],"lastnames":["Weikum"],"firstnames":["Gerhard"],"suffixes":[]},{"propositions":[],"lastnames":["Tollis"],"firstnames":["Ioannis","G."],"suffixes":[]},{"propositions":[],"lastnames":["Patrignani"],"firstnames":["Maurizio"],"suffixes":[]}],"year":"2009","doi":"10.1007/978-3-642-00219-9_22","pages":"230–241","bibtex":"@incollection{hutchison_topology_2009,\n\taddress = {Berlin, Heidelberg},\n\ttitle = {Topology {Preserving} {Constrained} {Graph} {Layout}},\n\tvolume = {5417},\n\tisbn = {978-3-642-00218-2 978-3-642-00219-9},\n\turl = {http://link.springer.com/10.1007/978-3-642-00219-9_22},\n\tabstract = {Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.},\n\tlanguage = {en},\n\turldate = {2018-07-11},\n\tbooktitle = {Graph {Drawing}},\n\tpublisher = {Springer Berlin Heidelberg},\n\tauthor = {Dwyer, Tim and Marriott, Kim and Wybrow, Michael},\n\teditor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Tollis, Ioannis G. and Patrignani, Maurizio},\n\tyear = {2009},\n\tdoi = {10.1007/978-3-642-00219-9_22},\n\tpages = {230--241},\n}\n\n","author_short":["Dwyer, T.","Marriott, K.","Wybrow, M."],"editor_short":["Hutchison, D.","Kanade, T.","Kittler, J.","Kleinberg, J. M.","Mattern, F.","Mitchell, J. C.","Naor, M.","Nierstrasz, O.","Pandu Rangan, C.","Steffen, B.","Sudan, M.","Terzopoulos, D.","Tygar, D.","Vardi, M. Y.","Weikum, G.","Tollis, I. G.","Patrignani, M."],"key":"hutchison_topology_2009","id":"hutchison_topology_2009","bibbaseid":"dwyer-marriott-wybrow-topologypreservingconstrainedgraphlayout-2009","role":"author","urls":{"Paper":"http://link.springer.com/10.1007/978-3-642-00219-9_22"},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["topology","preserving","constrained","graph","layout","dwyer","marriott","wybrow"],"keywords":[],"authorIDs":[],"dataSources":["LN3FoieZ5rtyN4g4w"]}