DJ Delorie wrote: We *still* miss pads that are within minspace of the edge > of a polygon but neither intersect nor plow into the polygon.
Sounds like we're wanting a full on assertion checker for "Is it near a polygon", but want to avoid going down to the level of diced triangles that add up to create the curvy shapes left over from big polygons keeping away from vias and pads and traces. There's no way to avoid it and get the ultimate check on the fast moving program execution. From straight geometry, to tell whether you are in a triangle, you have to define interior of triangle, so you sort defining points at some point in program execution into leftmost, rightmost, and third point of triangle. Then you file that one as below or above, (referring to Cartesian coordinates), the line that connects the leftmost, rightmost points. Then you know the order to consider points so that you can tell that "to the right of line (a,b)" is interior or exterior. It's all a lot of coding work! I don't see any way around it though to be sure all along that it's "correct" as in DRC correct for a high priced run of boards or printed conductor/semiconductor. John PS I haven't looked at the pcb code -- the above is all theory, no practice. busy reading verilog-ams. _______________________________________________ geda-dev mailing list geda-dev@moria.seul.org http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
