* Noding of geometry graph:
* * Naive edge set intersector O(n^2)
* * Simple rounder based on Hobby's hot points, but O(n^2)
* * I want to use plane sweep algorithm - Bentley and Ottman, but this algorithm need exact computation. I have exact computation, but only sign of determinant and for double input. I need it but for exact input. So on this algorithm I failed. More about reason, see PlaneSweep comment.
* NoderImpl tested on basic examples. Simple edge set intersector also on special cases and rounder on basic examples.
* Implemented ISO ST_Point, ST_LineString and tested with GeometryGraph (creation using GeometryGraphFactory and noding using above noder).
* Other next modifications.