Show simple item record

dc.contributor.authorFreivalds, K.en_US
dc.contributor.authorDoğrusöz, Uğuren_US
dc.contributor.authorKikusts, P.en_US
dc.coverage.spatialVienna, Austriaen_US
dc.date.accessioned2016-02-08T11:56:31Z
dc.date.available2016-02-08T11:56:31Zen_US
dc.date.issued2002en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27557en_US
dc.descriptionConference name: GD: International Symposium on Graph Drawing 9th International Symposiumen_US
dc.descriptionDate of Conference: 23–26 September 2001en_US
dc.description.abstractWe review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles. The parameters of our algorithm and their influence on the drawings produced as well as a variation of the algorithm for multiple pages are discussed. We also analyze our algorithm both theoretically and experimentally and compare it with the existing ones. The new approach produces much more compact and uniform drawings than previous methods. © Springer-Verlag Berlin Heidelberg 2002.en_US
dc.language.isoEnglishen_US
dc.source.titleGraph Drawingen_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-45848-4_30en_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-45848-4en_US
dc.subjectDisconnected Graphen_US
dc.subjectPolyominoesen_US
dc.subjectNew approachesen_US
dc.subjectDrawing (graphics)en_US
dc.subjectAlgorithmsen_US
dc.titleDisconnected graph layout and the polyomino packing approachen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage378en_US
dc.citation.epage391en_US
dc.citation.volumeNumber2265en_US
dc.identifier.doi10.1007/3-540-45848-4_30en_US
dc.identifier.doi10.1007/3-540-45848-4en_US
dc.publisherSpringer, Berlin, Heidelbergen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record