Xref: utzoo comp.theory:992 comp.graphics:13078
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!tut.cis.ohio-state.edu!uc!cs.umn.edu!martin
From: martin@cs.umn.edu (Johnny Martin)
Newsgroups: comp.theory,comp.graphics
Subject: Re: Planar graph embedding
Message-ID: <1990Aug28.210258.29695@cs.umn.edu>
Date: 28 Aug 90 21:02:58 GMT
References: <1990Aug28.155431.12306@Neon.Stanford.EDU>
Organization: University of Minnesota, Minneapolis - CSCI Dept.
Lines: 34

In article <1990Aug28.155431.12306@Neon.Stanford.EDU> rivin@Gang-of-Four.Stanford.EDU (Igor Rivin) writes:
>
>Would anyone happen to have a program that would construct a planar
>embedding of a planar graph? It needn't check for planarity, though it
>might as well. Getting greedy, what about "nice" embeddings, which can
>be defined as
>
>a) ones that look nice
>
>b) Less fuzzy, but not obviously equivalent to a), ones that attempt
>to maximize the smallest angle between the edges, and also minimize
>the ratio between the longest and the shortest edge. (I am not sure
>this is the best definition, any other ideas?)
>
>	Thanks.
>
>--
>Igor Rivin                                Wolfram Research, Inc.
>rivin@Gang-of-Four.Stanford.EDU or
>rivin@wri.com

A couple of years ago I was given a copy of a paper by Peter Eades and
Roberto Tamassia: "Algorithms for Automatic Graph Drawing: An
Annotated Bibliography."  On the bottom of the paper someone scribbled
"to appear July 1987."  I don't know where, when, or if it appeared.
In lieu of a more exact reference, I can mail you a copy of the paper.
Send me you postal address, or better yet, if you find out where it
appeared let me know.

-- johnny martin
-- 
Johnny Martin          (martin@umn-cs.cs.umn.edu)
Dept. Comp. Sci., 4-192 EE/CS, University of Minnesota, Minneapolis MN 55455
--