hasufell c8914c8272 POLYINT: small refactor ... Get predecessors and successors in the beginning instead of figuring them out for every single point separetely. This is still O(n), butt should be a lot quicker than the previous approach.		2014-10-26 04:22:05 +01:00
..
Core.hs	POLYINT: small refactor	2014-10-26 04:22:05 +01:00
UB2_einfachCCW.obj	Fix example mesh	2014-10-25 03:15:00 +02:00
UB2_einfachCW.obj	POLYINT: first try of polygon intersection algorithm in O(n)	2014-10-25 01:44:13 +02:00