5 Commits

Author	SHA1	Message	Date
hasufell	d81b6b1cec	POLYINT: improve haddock doc	2014-10-26 14:58:43 +01:00
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
hasufell	fd931db7e0	Improve readability	2014-10-25 20:39:34 +02:00
hasufell	c4c397e12f	POLYINT: small refactor, abstract some stuff out	2014-10-25 20:23:34 +02:00
hasufell	9a101d68a5	POLYINT: first try of polygon intersection algorithm in O(n)	2014-10-25 01:44:13 +02:00