kicad-developers team mailing list archive
-
kicad-developers team
-
Mailing list archive
-
Message #22675
Re: [RFC PATCH] Rounded rectangle pads
-
To:
jp charras <jp.charras@xxxxxxxxxx>, <kicad-developers@xxxxxxxxxxxxxxxxxxx>
-
From:
Tomasz Wlostowski <tomasz.wlostowski@xxxxxxx>
-
Date:
Fri, 15 Jan 2016 21:20:21 +0100
-
Authentication-results:
spf=pass (sender IP is 188.184.36.50) smtp.mailfrom=cern.ch; lists.launchpad.net; dkim=none (message not signed) header.d=none;lists.launchpad.net; dmarc=bestguesspass action=none header.from=cern.ch;
-
In-reply-to:
<56995069.7030500@wanadoo.fr>
-
Spamdiagnosticmetadata:
NSPM
-
Spamdiagnosticoutput:
1:23
-
User-agent:
Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101 Thunderbird/38.5.1
On 15.01.2016 21:02, jp charras wrote:
> Le 14/01/2016 01:39, Cirilo Bernardo a écrit :
>> On Tue, Jan 12, 2016 at 10:06 AM, Mathias Grimmberger <mgri@xxxxxxxxxxxxx>
>> wrote:
>
> <....>
>
>> I'd like to implement arbitrary pad shapes but this requires a functional 2D
>> geometry kernel first. I'm starting on one but I may have nothing to
>> demonstrate
>
> There is already a geometry kernel in Kicad: Have a look at
> include/geometry before writing anything.
Hi JP & Cirilo,
Indeed, there is a lightweight geometry kernel, used by the P&S. It can
do collision detection really fast - this means improvement of the DRC &
connectivity checking too. Instead of writing a new kernel, we should
focus on adding features to the existing one. What's currently missing:
- arc support (SHAPE_ARC)
- efficient indexing of large polygons (generating convex partitions and
indexing convex polygons with smaller overlap).
With these two features, we can have arbitrary pad shapes, teardrops,
improved connectivity calculation (= stitching vias) and much faster DRC.
Cheers,
Tom
References