home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!news.ils.nwu.edu!siegle
- From: siegle@ils.nwu.edu (Greg Siegle)
- Subject: req: crossover minimization algorithm
- Message-ID: <1992Jul30.174240.14953@ils.nwu.edu>
- Sender: usenet@ils.nwu.edu (Mr. usenet)
- Nntp-Posting-Host: aristotle.ils.nwu.edu
- Organization: The Institute for the Learning Sciences
- Distribution: usa
- Date: Thu, 30 Jul 1992 17:42:40 GMT
- Lines: 18
-
- Hi there,
- I'm looking for an algorithm to create a "mostly untangled" layout
- for arbitrary graphs. That is, given a list of vertices and
- connections between vertices I'd like to plot the vertices and
- connections on a plane minimizing edge crossings. Ideally if the
- algorithm is applied to a planar graph, no two edges should cross.
- In a really ideal world, I'd like the algorithm to be an
- "anytime" algorithm such that if I stop it at any time before it's
- "done" it can give me what it has. The produced graph should become
- progressively less tangled as time passes.
- I don't care so much if its really slow.
- Does such a beast exist? If you have any information regarding its
- whereabouts or eventual capture please mail me, as I don't read this
- group regularly.
- Thanks very much for your help.
- Sincerely,
- Greg Siegle
-
-