Xref: utzoo comp.lang.lisp:3313 comp.graphics:11935
Path: utzoo!attcan!uunet!cs.utexas.edu!uwm.edu!rpi!uupsi!sunic!sics.se!olleo
From: olleo@sics.se (Olle Olsson)
Newsgroups: comp.lang.lisp,comp.graphics
Subject: Graph display algorithms
Message-ID: <1990Jun15.145824.1056@sics.se>
Date: 15 Jun 90 14:58:24 GMT
Sender: olleo@sics.se (Olle Olsson)
Reply-To: olleo@horus (Olle Olsson)
Followup-To: comp.lang.lisp
Organization: Swedish Institute of Computer Science, Kista
Lines: 9

Does anybody have implemented algorithms (or pointers to descriptions of such)
regarding graph display in the following areas:
  - orthogonal grid drawings
  - planarization
  - bend streching
  - bend minimization
  - orthogonalization
The aim is to avoid reinventing/reimplementing what others have done. 
--