🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: comp.constraints
4 messages
4 total messages Started by Wendy Williams Fri, 17 Jan 1997 00:00
2D graph layout question
#3
Author: Wendy Williams
Date: Fri, 17 Jan 1997 00:00
40 lines
2108 bytes
I am interested in graphing a network of nodes from a description that
only includes node description (i.e., shape of node, colour, text, ...)
and connections between nodes.  Layout is the problem, not actually
drawing the picture.

What I am interested in is any/all of the following:

1) what algorithms are used for automatic layout so that the final
drawing is readily understandable to the human (simply drawn without a
lot of crossing lines).

2) Is (and if so, how) overview vs detail presented for huge graphs
(2000 or more nodes). Is editing supported?

3) what are some of the main research groups that are interested in this

4) what are some of the industrial applications of automatic layout
(VLSI, OO tools, network management tools, ?) references/names would be
greatly appreciated

5) What tools and technologies/languages make this easier to manage.
What
technologies? Expert system rules? Genetic algorithms? Constraint
satisfaction? 

I think emailing me would be most efficient for everyone, as I would
hate to miss any responses.  I would be glad to post a summary of
responses or email anyone who is interested in a collection of
emails/postings that I receive.

Thanks a million,
/ww
--
Wendy Williams
Software Architect

wendy@magma.ca
www.magma.ca/~wendy/wendy
613-825-0050
Re: 2D graph layout question
#4
Author: Amit Steinberg
Date: Thu, 23 Jan 1997 00:00
11 lines
1190 bytes
A. That's really interesting. EMail me what you have. Thanks.
B. It might be interesting for others. Why not post it to the newsgroup
?

Wendy Williams wrote:
> 
> I am interested in graphing a network of nodes from a description that
> only includes node description (i.e., shape of node, colour, text, ...)
> and connections between nodes.  Layout is the problem, not actually
> drawing the picture.
Re: 2D graph layout question
#5
Author: Dr. rer. nat. Walter Hower
Date: Fri, 24 Jan 1997 00:00
13 lines
1085 bytes
You may consult my WWW page http://yeats.ucc.ie/~walter/ where the
two '96 entries of the 'Research extract' items point to 2 papers.
Kind regards -
Dr. Walter Hower
Department of Computer Science
University College Cork
National University of Ireland
Western Rd
Cork
Republic of Ireland
-- 
walter@cs.ucc.ie
Re: 2D graph layout question
#6
Author: Duane Allen
Date: Tue, 28 Jan 1997 00:00
42 lines
2343 bytes
One application of the connection of nodes is in printed circuit
board layout.  Since this is an mature technology, I suspect you
may be able to find references to layout algorithms in electroincs
manufacturing texts.

Use of the search engine http://www.lycos.com/ for "printed circuit
board layout" yielded more sites than I wish to explore.  One company
listed with a name that seemed appropriate for this news group was
http://www.orcad.com/.

Wishing you success in your search,
Duane Allen

Wendy Williams wrote:
> 
> I am interested in graphing a network of nodes from a description that
> only includes node description (i.e., shape of node, colour, text, ...)
> and connections between nodes.  Layout is the problem, not actually
> drawing the picture.
> 
> What I am interested in is any/all of the following:
> 
> 1) what algorithms are used for automatic layout so that the final
> drawing is readily understandable to the human (simply drawn without a
> lot of crossing lines).
> 
> 2) Is (and if so, how) overview vs detail presented for huge graphs
> (2000 or more nodes). Is editing supported?
> 
> 3) what are some of the main research groups that are interested in this
> 
> 4) what are some of the industrial applications of automatic layout
> (VLSI, OO tools, network management tools, ?) references/names would be
> greatly appreciated
> 
> 5) What tools and technologies/languages make this easier to manage.
> What
> technologies? Expert system rules? Genetic algorithms? Constraint
> satisfaction?
> 
> ...
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads