delorie.com/archives/browse.cgi | search |
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.)
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |