So I've just completed a (2 layer) board where it was a challenge to keep the ground and power planes from getting chewed up beyond usefulness. It made me think it would be nice if the DRC could warn about thin necks in polygons. How hard would it be to do a computation like that?
I would propose a rule that checked to make sure that for every polygon region, it was in sum connected to neighboring regions by at least XX mils width of copper. Not sure how easy it is to identify "regions" and do that sort of computation. Or maybe that each region has at least one neck of at least xxx mils to a neighbor region. Another approach that might have some utility is to do a temporary polygon computation using the same poly clearing code as now, except to use a wider clearance number on all the tracks. Then XOR the resulting temporary polygon with the real polygon. Big voids would show up indicating weakly connected regions. OK... enough random brain wandering.... -dave _______________________________________________ geda-user mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-user
