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=ibfPI070KxR6Euzz6D9J0GycgLTrzOiygCU2qjccXyA=;
        b=DuY+qNzt4OcUYGnXiDtfYxkwQc38R9yxlPzxUsWLvkB8qgB8aXzTUFzKwfze6Mc00n
         UGMFUlRadHmWl5RyLSNHWYfVQlpRRYscyH7dDx8sdcHrMk2OGpDRpvg7HZQYqt92Ek5O
         h1Rd1Vw3sCn3pGYeI5TqbwHb509mizcahqD2BJsXnZYIkWNlHYEpC1Wd3ZkuJcAvoJeH
         HA3oZ8IdNx2rzYegUPbyvQNSSC5QILnW+4cj9Y9E0R7yQArh9fzpMe7QDwackehJSk3X
         yFEoZyh8lVxqAi0YLtUjEdjO/pq4m5x+HSZo4uklW5KvWvBorbZH9gBcMO0rDkLlcOYB
         QLaQ==
MIME-Version: 1.0
X-Received: by 10.50.78.231 with SMTP id e7mr25316150igx.93.1445952756463;
 Tue, 27 Oct 2015 06:32:36 -0700 (PDT)
In-Reply-To: <20151027124734.27056.qmail@stuge.se>
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>
	<20151027124734 DOT 27056 DOT qmail AT stuge DOT se>
Date: Tue, 27 Oct 2015 14:32:36 +0100
Message-ID: <CACwWb3B13uUF2gMoeY5UNodXttiJUKiHDrrqa_sNy_w_P1ff6w@mail.gmail.com>
Subject: Re: [geda-user] home/bkerin/geometry_module branch
From: "Levente (leventelist AT gmail DOT com) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com>
To: gEDA User Mailing List <geda-user AT delorie DOT com>
Content-Type: multipart/alternative; boundary=089e013c649e693e390523161c07
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

--089e013c649e693e390523161c07
Content-Type: text/plain; charset=UTF-8

Yes, that makes sense.

So let us write down what kind of geometric calculation we use today in
PCB. Then we should write down what nice features are blocked because of
lack of other geometric calculation.

For example, I'd implement the rounding of polygons like this:



----------           to have something like this:      ---------------

/                                                                         )

/                                                                        /


Lev


On Tue, Oct 27, 2015 at 1:47 PM, Peter Stuge (peter AT stuge DOT se) [via
geda-user AT delorie DOT com] <geda-user AT delorie DOT com> wrote:

> Levente (leventelist AT gmail DOT com) [via geda-user AT delorie DOT com] wrote:
> > Let us start a technical discussion.
> >
> > 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.
>
> Distance between two points on a plane is easy and two points on two
> different but parallel planes is actually the same problem.
>
> Polygon "handling" - can you go into more detail here?
>
> You mentioned polygons enclosed in other polygons, that seems like it
> would be a strightforward problem, but OTOH I haven't implemented it..
>
>
> > But there are others.
>
> I think it's important to look into what specific functions we want to
> use on one hand immediately and on the other hand in the middle term.
> Please keep them coming.
>
>
> //Peter
>

--089e013c649e693e390523161c07
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div><div><div>Yes, that makes sense.<br><br></div>So let =
us write down what kind of geometric calculation we use today in PCB. Then =
we should write down what nice features are blocked because of lack of othe=
r geometric calculation.<br><br></div>For example, I&#39;d implement the ro=
unding of polygons like this:<br><br><br><br></div><div>----------=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 to have something like =
this:=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 ---------------<br></div>=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 /=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0 )<br>=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 /=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=
=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 /<br><div><br></div><div><br></div><di=
v>Lev<br></div><div><br></div></div><div class=3D"gmail_extra"><br><div cla=
ss=3D"gmail_quote">On Tue, Oct 27, 2015 at 1:47 PM, Peter Stuge (<a href=3D=
"mailto:peter AT stuge DOT se">peter AT stuge DOT se</a>) [via <a href=3D"mailto:geda-use=
r AT delorie DOT com">geda-user AT delorie DOT com</a>] <span dir=3D"ltr">&lt;<a href=3D"=
mailto:geda-user AT delorie DOT com" target=3D"_blank">geda-user AT delorie DOT com</a>&g=
t;</span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0=
 .8ex;border-left:1px #ccc solid;padding-left:1ex"><span class=3D"">Levente=
 (<a href=3D"mailto:leventelist AT gmail DOT com">leventelist AT gmail DOT com</a>) [via =
<a href=3D"mailto:geda-user AT delorie DOT com">geda-user AT delorie DOT com</a>] wrote:<=
br>
</span><span class=3D"">&gt; Let us start a technical discussion.<br>
&gt;<br>
</span><span class=3D"">&gt; There is for exaple distance calculation code,=
 polygon handling, so for<br>
&gt; example we could detect polygons that are fully covered by another one=
.<br>
&gt; That is only one thing.<br>
<br>
</span>Distance between two points on a plane is easy and two points on two=
<br>
different but parallel planes is actually the same problem.<br>
<br>
Polygon &quot;handling&quot; - can you go into more detail here?<br>
<br>
You mentioned polygons enclosed in other polygons, that seems like it<br>
would be a strightforward problem, but OTOH I haven&#39;t implemented it..<=
br>
<br>
<br>
&gt; But there are others.<br>
<br>
I think it&#39;s important to look into what specific functions we want to<=
br>
use on one hand immediately and on the other hand in the middle term.<br>
Please keep them coming.<br>
<br>
<br>
//Peter<br>
</blockquote></div><br></div>

--089e013c649e693e390523161c07--