(forwarded on behlf of Alan Gonzalez)
On Wed, 31 Jan 2001, Alan Gonzalez wrote:
> Date: Wed, 31 Jan 2001 21:47:41 -0800 (PST)
> To: [EMAIL PROTECTED]
> From: Alan Gonzalez <[EMAIL PROTECTED]>
> Reply-To: [EMAIL PROTECTED]
> Subject: Re: Re: How to draw "smart" connectors in wiring diagrams?
>
> Ok, so this is similar to a prerouter i route. We are looking for
> close to
> shortest path, with a minimal amount of bends. Things like minimum
> spanning
> tree and shortest path can lead to a bit messy looking routes. The
> prerouter i
> wrote basically tries to keep things as straight as possible. So
> it will route
> the furthest items first, and then try to use this as a trunk and
> branch off
> this trunk, kinda of a ladder effect. One thing that makes this
> easier is when
> gridding is enabled so there are predefined tracks which the routes
> can take.
> In the case that gridding is not enabled, then i guess we can
> create an
> artificial smaller grid, which the user would not notice.
>
> Oh, BTW is Dia in C or C++. I haven't checked.. oh ok i see it's
> part of gnome
> so it's C. Hmm, well not especially my cup of tea, and also i was
> going to try
> to use the Graph Template Library which is part of Boost, but i
> guess that's
> out of the question. Most of the stuff i've done has been in C++
> and am rusty
> with C. I'll look around at the sources and see if i can get into
> it.
>
> Alan
>
>
> --- Harry George <[EMAIL PROTECTED]> wrote:
> > Clean, readable manhatten routing would be great, and reasonably
> > eye-pleasing. True shortest path routing can look ugly.
> >
> > On Tue, 30 Jan 2001, Alan Gonzalez wrote:
> > > Date: Tue, 30 Jan 2001 22:41:42 -0800 (PST)
> > > To: [EMAIL PROTECTED]
> > > From: Alan Gonzalez <[EMAIL PROTECTED]>
> > > Reply-To: [EMAIL PROTECTED]
> > > Subject: Re: How to draw "smart" connectors in wiring diagrams?
> > >
> > > Hi, i have started playing around with Dia, and well haven't
> used
> > > Visio all
> > > that much. Anyways, i was a bit intrigued with the autorouting
> > > topic. When
> > > someone is saying autorouting, are we talking about
> placing/routing
> > > or just
> > > routing. As someone mentioned... the program "dot" goes
> through a
> > > lot of
> > > effort trying to make a "good/eye pleasing" placement for a
> logical
> > > grouping,
> > > the easier part of it is routing i believe.
> > >
> > > So if autorouting is simply having objects placed on the screen
> and
> > > you want
> > > connections automatically made, then that's relatively simple.
> > > I've written a
> > > VLSI router before (and am currently). In terms of someone's
> > > comment about
> > > magic, i wouldn't even go there since it's way too directed.
> For
> > > dia, i don't
> > > think we'll be needing congestion mapping, global routing then
> > > detailed routing
> > > and besides having all sorts of design rule violations. We can
> > > have some
> > > spacing rules, but you don't need all the types of things that
> > > magic provides.
> > >
> > > The only thing that dia complicates is the ability to have
> > > non-rectangular
> > > routes, so your dealing with a purely academic type of shortest
> > > path. I'm used
> > > to manhattan type routing where routes need to be 90 degree
> turns.
> > > This
> > > complicates things in terms of the intersection calculation
> > > routines, blockage
> > > detection. The graph can stay the same though.
> > >
> > > Anyways, i was just looking for a clarification. thanks.
> > >
> > > Alan Gonzalez
> > >
> > > __________________________________________________
> > > Get personalized email addresses from Yahoo! Mail - only $35
> > > a year! http://personal.mail.yahoo.com/
> > >
> > >
> > >
> > --
> > Harry George
> > [EMAIL PROTECTED]
> >
>
>
> __________________________________________________
> Get personalized email addresses from Yahoo! Mail - only $35
> a year! http://personal.mail.yahoo.com/
>
>
--
Harry George
[EMAIL PROTECTED]
