Xref: utzoo comp.theory:989 comp.graphics:13075
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!wuarchive!rex!samsung!uakari.primate.wisc.edu!sdd.hp.com!decwrl!shelby!neon!news
From: rivin@Gang-of-Four.Stanford.EDU (Igor Rivin)
Newsgroups: comp.theory,comp.graphics
Subject: Planar graph embedding
Message-ID: <1990Aug28.155431.12306@Neon.Stanford.EDU>
Date: 28 Aug 90 15:54:31 GMT
Sender: news@Neon.Stanford.EDU (USENET News System)
Organization: Computer Science Department, Stanford University
Lines: 19


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