delorie.com/archives/browse.cgi   search  
Mail Archives: geda-user/2015/10/11/15:07:31

X-Authentication-Warning: delorie.com: mail set sender to geda-user-bounces using -f
X-Recipient: geda-user AT delorie DOT com
Message-ID: <1444589890.676.20.camel@ssalewski.de>
Subject: Re: [geda-user] GTK3, Glade interface designer (router, auto?)
From: Stefan Salewski <mail AT ssalewski DOT de>
To: geda-user AT delorie DOT com
Date: Sun, 11 Oct 2015 20:58:10 +0200
In-Reply-To: <mvea9j$ar6$1@ger.gmane.org>
References: <20151003210701 DOT de392b925f54dadb0a5fedd8 AT gmail DOT com>
<1443903758 DOT 1873 DOT 13 DOT camel AT ssalewski DOT de> <56104A0A DOT 9020507 AT xs4all DOT nl>
<1443909591 DOT 1873 DOT 18 DOT camel AT ssalewski DOT de>
<CAC4O8c_g7e562Gaotrbi6gLfjP6cJU1ys=MtEkDE7bSh4F9dfg AT mail DOT gmail DOT com>
<1443975731 DOT 671 DOT 52 DOT camel AT ssalewski DOT de>
<20151004191717 DOT bf8223417541a9306bfbd9ea AT gmail DOT com>
<CAC4O8c9Bi5HJfcW6wUgm_+4O2gs4vDdBMbS2hF_0dCqnBuJahQ AT mail DOT gmail DOT com>
<1443997480 DOT 2068 DOT 32 DOT camel AT ssalewski DOT de>
<CAC4O8c-bnGky=Nab59-pOTJkB8Q9Tc5t5hqE+dnEF-777hUjMg AT mail DOT gmail DOT com>
<1444070851 DOT 1014 DOT 20 DOT camel AT ssalewski DOT de> <muv4ua$hat$1 AT ger DOT gmane DOT org>
<1444157156 DOT 1949 DOT 52 DOT camel AT ssalewski DOT de> <mvckfg$teb$1 AT ger DOT gmane DOT org>
<1444567608 DOT 973 DOT 15 DOT camel AT ssalewski DOT de> <mvea9j$ar6$1 AT ger DOT gmane DOT org>
X-Mailer: Evolution 3.16.5
Mime-Version: 1.0
Reply-To: geda-user AT delorie DOT com
Errors-To: nobody AT delorie DOT com
X-Mailing-List: geda-user AT delorie DOT com
X-Unsubscribes-To: listserv AT delorie DOT com

On Sun, 2015-10-11 at 20:37 +0200, Kai-Martin Knaak wrote:
> Thank you. This link worked nicely.
> 
> I will try to get a grasp how the algorithm works. Don't expect me to
> come up with ideas for improvement. All the simple routes have
> probably
> already been thoroughly explored.

There is much room for improvements, as I already said. One reason is,
that Tal Dayan's thesis is less concerned with PCB and the space
restrictions. For example when you read about layer assignment, it is
clear that that algorithm is nice, but it assumes that only traces build
barriers for other traces. But on PCB dense spaced pin rows can built
barriers too. That is only one point, which I can currently remember and
I have not tried to improve. Another point is, that I used a lot of
hashes to mark blocked paths. I was not really happy with that, it
works, but is a simple minded way. The thesis told us only about the
region idea, but not how they really did it unfortunately. (But they
have 14k lines of code as they told, we have only 2k.)

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019