delorie.com/archives/browse.cgi   search  
Mail Archives: geda-user/2015/10/27/10:23:13

X-Authentication-Warning: delorie.com: mail set sender to geda-user-bounces using -f
X-Recipient: geda-user AT delorie DOT com
X-Envelope-From: paubert AT iram DOT es
Date: Tue, 27 Oct 2015 15:22:43 +0100
From: "Gabriel Paubert (paubert AT iram DOT es) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com>
To: "Nicklas Karlsson (nicklas DOT karlsson17 AT gmail DOT com) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com>
Subject: Re: [geda-user] home/bkerin/geometry_module branch
Message-ID: <20151027142243.GA22930@visitor2.iram.es>
References: <CAC4O8c_0jg9_VbT82H3P7uNi90zg=7O1Bya3ZwPW1MybP-yO9Q AT mail DOT gmail DOT com>
<CACwWb3CcWkRz9Wnz+tFKTc+PkP8sZEEJ8kJX=08gM28P4RrE7w AT mail DOT gmail DOT com>
<alpine DOT DEB DOT 2 DOT 00 DOT 1510271032140 DOT 7137 AT igor2priv>
<CACwWb3Cwwe1kVwH62QOgg1yz7xwOfjW6mdiuikDJ9_iNr+8PAw AT mail DOT gmail DOT com>
<20151027103752 DOT 17300 DOT qmail AT stuge DOT se>
<20151027121151 DOT 84a401be8b0d162eea027ad9 AT gmail DOT com>
<CACwWb3B5eTWmAeVVoO_w3Pz-3j6JUAxzpOxTML96E0WzA6wF8w AT mail DOT gmail DOT com>
<alpine DOT DEB DOT 2 DOT 00 DOT 1510271342490 DOT 7137 AT igor2priv>
<20151027140102 DOT 5c4fb49a2a26bd4b70f6d61c AT gmail DOT com>
MIME-Version: 1.0
In-Reply-To: <20151027140102.5c4fb49a2a26bd4b70f6d61c@gmail.com>
User-Agent: Mutt/1.5.21 (2010-09-15)
X-Spamina-Bogosity: Unsure
X-Spamina-Spam-Score: -0.2 (/)
X-Spamina-Spam-Report: Content analysis details: (-0.2 points)
pts rule name description
---- ---------------------- --------------------------------------------------
-1.0 ALL_TRUSTED Passed through trusted hosts only via SMTP
0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked.
See
http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block
for more information.
[URIs: delorie.com]
0.8 BAYES_50 BODY: Bayes spam probability is 40 to 60%
[score: 0.4670]
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

On Tue, Oct 27, 2015 at 02:01:02PM +0100, Nicklas Karlsson (nicklas DOT karlsson17 AT gmail DOT com) [via geda-user AT delorie DOT com] wrote:
> > >Okay people... sorry. Calm down.
> > 
> > No worries, I'm totally calm (I use pcb-rnd, and none of these ideas 
> > affect that fork).
> > 
> > >
> > >Let us start a technical discussion.
> > >
> > >Igor2: I didn't want to reflect your other points.
> > >
> > >There is for exaple distance calculation code, polygon handling, so for
> > >example we could detect polygons that are fully covered by another one. That
> > >is only one thing.
> > >But there are others.
> > 
> > I think we should go the other way around. First enumerate what exactly is 
> > needed to clean up the current code at the parts where things are 
> > happening nowdays (Britton is in a good position for that, I think). Then 
> > enumerate what's needed to clean up other parts of the code, like the poly 
> > dicer or the toporouter. Finally enumerate what kind of plans PCB has for 
> > the future and what features could potentially help those.
> > 
> > Once there's a list, it makes sense to evaluate libs, see if they provide 
> > all items on the list and how much extra (useful stuff or bloat) they 
> > would bring in. If it turns out there's no good deal with existing libs, 
> > don't be affraid to roll our own.
> > 
> > Picking a lib without these steps seems unreasonable to me.
> > 
> > Regards,
> > 
> > Igor2
> 
> Agree.
> 
> What I now about is about: Draw different primitives which probably are the same as in Gerber, calculate distance between edges of primitives, calculate which objects overlap and hence form a physical net according to ohms law, calculate narrowest passage between different points for minimum trace width.

Acually Gerber does not have polygons, it has contours, in which the
boundary consists of a straight line segments and circular arcs, but
prohibits self-intersecting contours. As far as I know, for most (all) 
graphics libraries polygons are defined as the interior of a boundary 
defined by straight line segments (definition of what is the interior 
varies, but onle when the boundary is self-intersecting AFAIK).

    Gabriel

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019