RANDOMIZED GRAPH DRAWING WITH HEAVY-DUTY PREPROCESSING

被引：9

作者：

HAREL, D ^{[1
]}

SARDAS, M ^{[1
]}

机构：

[1] WEIZMANN INST SCI, DEPT APPL MATH & COMP SCI, IL-76100 REHOVOT, ISRAEL

来源：

JOURNAL OF VISUAL LANGUAGES AND COMPUTING | 1995年 / 6卷 / 03期

关键词：

D O I：

10.1006/jvlc.1995.1014

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 a 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. (C) 1995 Academic Press Limited

引用

页码：233 / 253

页数：21

共 28 条

[1]

Berge C., 1973, GRAPHS HYPERGRAPHS

[2] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].