"Curtis C. Pope" <cp...@hobbypcb.com> writes: > I'll take a look at DRC. I have looked at this before and come to the > same realization that you really need to compare the final polygons that > are created. Never thought about rendering to a surface and looking at > the pixels between objects. > > I also thought about the idea of creating the polygons (nets) and then > expanding each polygon by half the clearance value desired, then > rendering two nets and looking for overlaps.
I was thinking ... for most (all?) DRC checks, what we need are operations like * netlist extraction, i.e., figure out which objects are connected, * generate shapes resulting from the union of connected objects, * bloat or reduce those shapes by a certain amount, * boolean operations of shapes, * check if the connectivity changed by those operations., A DRC check would become an expression of these operations. Are there libraries that provide these primitives? -- Stephan ------------------------------------------------------------------------------ Create and publish websites with WebMatrix Use the most popular FREE web apps or write code yourself; WebMatrix provides all the features you need to develop and publish your website. http://p.sf.net/sfu/ms-webmatrix-sf _______________________________________________ Gerbv-devel mailing list Gerbv-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/gerbv-devel
