ftp.delorie.com/archives/browse.cgi | search |
X-Authentication-Warning: | delorie.com: mail set sender to geda-user-bounces using -f |
X-Recipient: | geda-user AT delorie DOT com |
Date: | Tue, 22 Dec 2015 20:51:37 +0100 |
From: | Martin Beranek <martin AT mb5 DOT cz> |
To: | "Peter Clifton (petercjclifton AT googlemail DOT com) [via geda-user AT delorie DOT com]" <geda-user AT delorie DOT com> |
Subject: | Re: [geda-user] Self-intersecting polygon appears because of |
intersection coordinates rounding | |
Message-ID: | <20151222195137.GP14853@abax> |
References: | <20151222144719 DOT GN14853 AT abax> |
<CAJXU7q9yKKheYd5fnQz=cax=+rMmjDGNCuojLquq6zsiYZmRxw AT mail DOT gmail DOT com> | |
MIME-Version: | 1.0 |
In-Reply-To: | <CAJXU7q9yKKheYd5fnQz=cax=+rMmjDGNCuojLquq6zsiYZmRxw@mail.gmail.com> |
User-Agent: | Mutt/1.5.23 (2014-03-12) |
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 |
> Clever solutions exist, and fall into the category of "snap rounding" > algorithms. Yepp, I have notice only now, that it is mentioned in geda wiki already. Together with the fact that cases leading to self-crossing polygons as a result exists. But, referring again to the geda wiki as I have almost no experience in this field, the snap rounding algorithm is not a fix (or not guaranteed fix?) to this self-intersecting issue, rather just faster algorithm to finding intersection points. Is it correct? Do you have any reference related to this degenerated case particularly? Martin
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |