Elsevier

Computational Geometry

Volume 4, Issue 5, October 1994, Pages 235-282
Computational Geometry

Algorithms for drawing graphs: an annotated bibliography

https://doi.org/10.1016/0925-7721(94)00014-XGet rights and content
Under an Elsevier user license
open archive

Abstract

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas.

Cited by (0)

This document is available via anonymous ftp from wilma.cs.brown.edu (128.148.33.66), files /pub/papers/compgeo/gdbiblio.tex.Z and /pub/papers/compgeo/gdbiblio.ps.Z. Research supported in part by the Army Research Office, by the National Science Foundation, and by the C.N.R. (Italy).

1

E-mail: [email protected].