Re: [Algorithms] Special cases of Weiler-Atherton

[<pie...@fr...>]

Hi,

I tried this almost 10 years ago :-)
The algorithm was Ok if I remember well but then I should have worked some float precision issues which I didn't do ;-(

May be this can help
http://pierloic.free.fr/clip/clip.html

-- 
pl


----- Mail original -----
De: "Andrzej Borucki" <bor...@gm...>
À: gda...@li...
Envoyé: Dimanche 23 Novembre 2014 13:30:55
Objet: [Algorithms] Special cases of Weiler-Atherton



I am writing Weiler-Atherton algorithm. I can't find full description of this. 
My source trial is on bitbucket on aborucki/weileratherton, this is unclear of brute_force_intersections() function because I am moving form brute-force to Bentley-Ottmann sweep line intersections. 
I have two main rountines: 
brute_force_intersections(): inserting points of intersections 

unionWalk - walk over lists and make union two polygons. 

In unionWalk are special cases: vertex of one polygon touch vertex second polygon etc 
Where can I find detail description of this algorithm? 


------------------------------------------------------------------------------
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
_______________________________________________
GDAlgorithms-list mailing list
GDA...@li...
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list