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=e03kXqoXkV+bjonmCHFEGhGTF5xOD/J/BaDkkDKGcR0=; b=wQ2FwGMsu1Htzsa2/WOmi4i6zaqNWyxbgl6QXZxPyFxtzui9T87YUz/gKB8c3s3u68 iPaxjZIRqMtcdw84Kai5X06VOAk/022EOCg77W6W9eD8+WCLRnONwY26rFv43ZGg04z4 CaoSOGvb3MbwRMBcASh5eA2/A4ldzjSz34sWKLNhG/4sdUvNITXWNtKTQV9CXlW5X5Tx MlB1R4D4ElNEnUU/MP/MVwRMD6ht9XJ+L0SalVQZMCvgh9jq9hBwyEIUPQXzrLxmQdv9 ql56rDCWsWTPociRA37qcjAgIcxT+XGLkO1d1HvZUnwOTTIuKeXFgmlCEYMdD/KWkYnm 39ow== MIME-Version: 1.0 X-Received: by 10.180.39.178 with SMTP id q18mr27532266wik.57.1445970333816; Tue, 27 Oct 2015 11:25:33 -0700 (PDT) In-Reply-To: References: <20151027103752 DOT 17300 DOT qmail AT stuge DOT se> <20151027121151 DOT 84a401be8b0d162eea027ad9 AT gmail DOT com> Date: Tue, 27 Oct 2015 10:25:33 -0800 Message-ID: Subject: Re: [geda-user] home/bkerin/geometry_module branch From: "Britton Kerin (britton DOT kerin AT gmail DOT com) [via geda-user AT delorie DOT com]" To: geda-user AT delorie DOT com Content-Type: multipart/alternative; boundary=001a11c22a521a655305231a34cf 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 Precedence: bulk --001a11c22a521a655305231a34cf Content-Type: text/plain; charset=UTF-8 On Tue, Oct 27, 2015 at 4:47 AM, wrote: > > > On Tue, 27 Oct 2015, Levente (leventelist 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 All I know is what's used in search.c and find.c. That code needs intersection test and nearest-point between lines, points, rectangles circles, and arcs of circles. I don't know on the polygon code since I've never been able to successfully draw one in pcb I don't care. In theory arcs of ellipse are supported but in practice the implementation isn't there. I doubt we care. The toporouter which is the most demanding curved-trace application I know of just uses arcs of circles. So I'd just disallow creating them for the moment, and die if they show up in a pcb file. 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. > What the toporouter does need is 2D triangulated surface. My impression is that it already uses CGAL via ruby. But I'm not sure that's a good reason to use it everywhere. It's not at all C-friendly and it's heavy --001a11c22a521a655305231a34cf Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable

On Tue, Oct 27, 2015 at 4:4= 7 AM, <gedau AT igor2 DOT repo DOT hu> wrote:
=

On Tue, 27 Oct 2015, Levente (leventelist 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 af= fect 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. Tha= t
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

All I know is what's used in search.c and find.c.=C2=A0 Tha= t code needs intersection test and nearest-point between lines, points, rec= tangles circles, and arcs of circles.=C2=A0 I don't know on the polygon= code since I've never been able to successfully draw one in pcb I don&= #39;t care.

In theory arcs of ellipse are supported but in practice = the implementation isn't there.=C2=A0 I doubt we care.=C2=A0 The toporo= uter which is the most demanding curved-trace application I know of just us= es arcs of circles.=C2=A0 So I'd just disallow creating them for the mo= ment, and die if they show up in a pcb file.

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.

What the toporouter does need is 2D triangulated su= rface.=C2=A0 My impression is that it already uses CGAL via ruby.=C2=A0 But= I'm not sure that's a good reason to use it everywhere.=C2=A0 It&#= 39;s not at all C-friendly and it's heavy

--001a11c22a521a655305231a34cf--