Randomized Graph Drawing with Heavy-Duty Preprocessing
| dc.contributor.author | Harel, David | en_US |
| dc.contributor.author | Sardas, Meir | en_US |
| dc.date.accessioned | 2007-04-23T18:01:40Z | |
| dc.date.available | 2007-04-23T18:01:40Z | |
| dc.date.issued | 1995-03 | en_US |
| dc.description.abstract | We 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.extent | 335579 bytes | |
| dc.format.extent | 394095 bytes | |
| dc.format.extent | 392814 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1503 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7161 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Randomized Graph Drawing with Heavy-Duty Preprocessing | en_US |
| dc.type | technical report | en_US |