Re: Special cases of Weiler-Atherton

Andrzej Borucki <[email protected]> Mon, 24 Nov 2014 15:55:04 +0100
Newsgroups gmane.games.devel.algorithms
Message-ID <CAE2KeAKACQt_E-wCep_Bq0i_Vb+J4Rih1TJqBzoAPNvWezdE8g@mail.gmail.com>
--===============3529774295815515199==
Content-Type: multipart/alternative; boundary=089e011766e5d267da05089bfaaa

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

Yes, I saw this.
And algorithm Greiner-Hormann is similar to this. In base version not
handles special cases, but is extension to special case by Foster and
Overleft. This extension requires computing if point is inside or outside
neighbor polygon. Fortunately is not need computing it for all vertices,
only for first, and vertices which meet intersections points
I don't know which if faster - Greiner-Hormann with special cases or Vatti?

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

<div dir=3D"ltr">Yes, I saw this.=C2=A0<div>And algorithm=C2=A0Greiner-Horm=
ann is similar to this. In base version not handles special cases, but is e=
xtension to special case by Foster and Overleft. This extension requires co=
mputing if point is inside or outside neighbor polygon. Fortunately is not =
need computing it for all vertices, only for first, and vertices which meet=
 intersections points</div><div class=3D"gmail_extra">I don&#39;t know whic=
h if faster - Greiner-Hormann with special cases or Vatti?</div></div>

--089e011766e5d267da05089bfaaa--


--===============3529774295815515199==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

------------------------------------------------------------------------------
Download BIRT iHub F-Type - The Free Enterprise-Grade BIRT Server
from Actuate! Instantly Supercharge Your Business Reports and Dashboards
with Interactivity, Sharing, Native Excel Exports, App Integration & more
Get technology previously reserved for billion-dollar corporations, FREE
http://pubads.g.doubleclick.net/gampad/clk?id=157005751&iu=/4140/ostg.clktrk
--===============3529774295815515199==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
GDAlgorithms-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
--===============3529774295815515199==--