Simultaneous Embedding of Planar Graphs with Few BendsErten, Cesim and Kobourov, Stephen G. (2004) Simultaneous Embedding of Planar Graphs with Few Bends. In: Graph Drawing 12th International Symposium, GD 2004, September 29October 2, 2004 , pp. 195205(Official URL: http://dx.doi.org/10.1007/9783540318439_21). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783540318439_21
AbstractWe present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n^2)× O(n^2) grid, with at most three bends per edge, where n is the number of vertices. For the case when the input graphs are both trees, only one bend per edge is required. We also describe an O(n) time algorithm for simultaneous embedding with fixededges for treepath pairs on the O(n)× O(n^2) grid with at most one bend per treeedge and no bends along path edges. This work is partially supported by the NSF under grant ACR0222920 and by ITCDI under grant 003297.
Actions (login required)
