delorie.com/archives/browse.cgi | search |
X-Authentication-Warning: | delorie.com: mail set sender to geda-user-bounces using -f |
X-Recipient: | geda-user AT delorie DOT com |
X-Original-DKIM-Signature: | v=1; a=rsa-sha256; c=relaxed/relaxed; |
d=gmail.com; s=20120113; | |
h=mime-version:in-reply-to:references:date:message-id:subject:from:to | |
:content-type; | |
bh=haqDOhgdD1a/Tc4aPZSUqSvYbNUyxyLoTJOYnjQ+Yfo=; | |
b=BPE1j+JL70UvPLl12Z46KJdSNQqDWF8GEqtvrA2+40mW5SYzAC3hdQXFfYIPrgpuS3 | |
13qLBa/R4wwVr5vxs8gHFgwWxF1Mh7gfjovUJOJG8VgiE4Jdpxkvpkds9H2Fs0fl7SV7 | |
q6ep5oNfpJbTDRUyGccWUQdnvYOPkIXmn8YjTmle6GZqpNz2q+4uYXH6cGELxQhwDSR3 | |
W31KKw+6pmP7EPtQ0v5sMrZiEVR8RQ5ihD0EJwYAAJkN3i+ERFZesg2muemQ78wftZB3 | |
zn1rdfEvLCypzt96rseN2SfaZDwV1z9jjXFF2RBmTmX4/UnXY7bMUi+6wOB+a+rp5r4i | |
6DrA== | |
MIME-Version: | 1.0 |
X-Received: | by 10.152.7.206 with SMTP id l14mr16682350laa.3.1436478705252; |
Thu, 09 Jul 2015 14:51:45 -0700 (PDT) | |
In-Reply-To: | <1436477539.1747.21.camel@ssalewski.de> |
References: | <1436477539 DOT 1747 DOT 21 DOT camel AT ssalewski DOT de> |
Date: | Thu, 9 Jul 2015 21:51:45 +0000 |
Message-ID: | <CAM2RGhQWUWhkx3u64vm6T+wxmmA1yL4mt1-dTTnRbVTJwFLqpQ@mail.gmail.com> |
Subject: | Re: [geda-user] What is the hardest part in a PCB layout program? |
From: | "Evan Foss (evanfoss AT gmail DOT com) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com> |
To: | geda-user AT delorie DOT com |
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 |
The hardest part for me to understand when I look at the code is where the geometry is processed vs where it is rendered. OT: Is DRC checking done via the rendering engine or is there a separate geometry engine that does this and verifies when traces and etc are connected? On 7/9/15, Stefan Salewski <mail AT ssalewski DOT de> wrote: > I have to admit that I do not know much about internals of a PCB layout > program. About 7 years ago I had a short look into the PCB code -- I > think I was very positive surprised that code size was not too big, but > of course I did not understand much. > > For a long time it was my impression that gerber export is very hard. > But about one year ago I had a short discussion with someone working on > some gerber stuff, and he said that for polygons, circular arcs and > straight lines gerber export is not that difficult. (I think he was > talking about constructing arbitrary curves in KiCad by line segments. > Can not really remember.) I think long time ago I read something about > polygon slicer on this list -- can not find it currently with google. I > had a look into wikipedia about gerber274X recently. My impression was > that we had positive and negative shapes for polygons, arcs and line > segments, which we can draw in arbitrary order. So my current impression > is that gerber export maybe is not that hard. Maybe it was with old > gerber274D ? > > Next difficult point is of course real time DRC, but that is basically > geometric intersection check. For elliptical arcs segments it may be > difficult I guess? > > And no, I do not plan one more layout tool currently... > But while so many smart people are still on this list, it may be a good > time to ask. > > -- Home http://evanfoss.googlepages.com/ Work http://forge.abcd.harvard.edu/gf/project/epl_engineering/wiki/
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |