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
..
ConvexHull	ALGO: improve haddock doc	2014-10-15 22:50:56 +02:00
PolygonIntersection	POLYINT: small refactor	2014-10-26 04:22:05 +01:00