X-Authentication-Warning: delorie.com: mail set sender to geda-user-bounces using -f X-Recipient: geda-user AT delorie DOT com Message-ID: <20151027124734.27056.qmail@stuge.se> Date: Tue, 27 Oct 2015 13:47:34 +0100 From: "Peter Stuge (peter AT stuge DOT se) [via geda-user AT delorie DOT com]" To: gEDA User Mailing List Subject: Re: [geda-user] home/bkerin/geometry_module branch Mail-Followup-To: gEDA User Mailing List References: <20151027103752 DOT 17300 DOT qmail AT stuge DOT se> <20151027121151 DOT 84a401be8b0d162eea027ad9 AT gmail DOT com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: 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 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