Show simple item record

dc.contributor.authorHarel, Daviden_US
dc.contributor.authorSardas, Meiren_US
dc.date.accessioned2007-04-23T18:01:40Z
dc.date.available2007-04-23T18:01:40Z
dc.date.issued1995-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1503en_US
dc.identifier.urihttps://hdl.handle.net/1813/7161
dc.description.abstractWe present a graph drawing system for general undirected graphs with straight-line edges. It carries out a rather complex set of preprocessing steps, designed to produce a topologically good, but not necessarily nice-looking layout, which is then subjected to downhill-only version of Davidson and Harel's simulated annealing beautification algorithm. The intermediate layout is planar for planar graphs and attempts to come close to planar for non-planar graphs. The system's results are better and faster than what the annealing approach is able to achieve on its own.en_US
dc.format.extent335579 bytes
dc.format.extent394095 bytes
dc.format.extent392814 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRandomized Graph Drawing with Heavy-Duty Preprocessingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics