X-Authentication-Warning: delorie.com: mail set sender to geda-user-bounces using -f Date: Tue, 11 Dec 2012 14:11:30 -0500 Message-Id: <201212111911.qBBJBUG3024801@envy.delorie.com> From: DJ Delorie To: geda-user AT delorie DOT com In-reply-to: (gedau AT igor2 DOT repo DOT hu) Subject: Re: [geda-user] Find rat lines References: <20121204183305 DOT 6b04c0dc AT jive DOT levalinux DOT org> <20121208112649 DOT 388a9d22 AT jive DOT levalinux DOT org> <1355011808 DOT 19390 DOT 8 DOT camel AT localhost> <1355188647 DOT 12937 DOT 14 DOT camel AT localhost> 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 Precedence: bulk > The propagation idea (parallel propagation of nets from all pins > finding the first collision) would work. We've spent some time trying to > construnct more examples to see how it'd perform. We think it'd > not find the "real cause" of the short, but something closer to it than > the current short highlight does. I've considered this idea also, and agree it's most likely to work. Given: * Pins obviously connect to "their" net * polygons likely connect to the net they have the most via'd pins to you could probably give a fuzzy-logic guess as to what each trace/arc/poly connects to. If the fuzzy value drops below, say, 90%, color code the trace.