db4o-sp Code-SVN

Implemented API of ISO for polygons.
Added support to geometry factory and geometry graphs

Many many changes. So step by step:
* 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.

Moved GeometryFactory(Impl) and CoordinatesFactory(Impl).
Created strategy for edge intersector - line arrangement. Implemented one concrete strategy of this type as Plane Sweep algorithm (Bentley and Ottmann with sweep line move from top to bottom). This algorithm is implemented to handle degeneracies as parallel edge with sweep line or more edges with one intersection point (all simply tested).
This is one from some part of implementation of topology graph (Create nodes and edges from geometry, Arrangement - this part, Noding - snap rounding, Labelling).

Refactoring: GeometryFactory(Impl) and CoordinatesFactory(Generic2D) moved.
com.db4o.sp.factories removed.

Added isInside test to CGAlgorithms. Implemented in 2D robustly and tested.
CGAlgoritmhs tests divided to 3 parts.

CIMPattern factory changed from class with static creator method to classic class with public method.

Created packages for overlay and relate operations.
These are on higher layer of library. Will be build on topology graph and its operations - sweepline intersection, snap rounding, labeling and so on.

In overlay implemented api for intersection, union, difference and symmetric difference.

In relate implemented Clementini intersection matrix (DE-9IM) and api for its computation.

Wrote test for CIMPatternFactory only.

To ST_Geometry added overlay operations and relate operations.

Deleted expression evaluator.

Deleted 3D algorithms - next development focused on 2D (with strategies for extensions to 3D).

Created robust kernel - sign of determinant (EGC with dynamic filter).

Created robust CG algorithms - orientation and isOnLine predicates.

Created robust line intersector - predicate is robust, intersection point computation based on homogeneous coordinates - approximately, but robustly (BigDecimal type with round off to double).

Created geometry and coordinate factories with interfaces.

Test cases (created and successfully passed):
1. Robust kernel
2. CG Algorithms
3. Line intersector

Created Expression evaluator.
From Expression removed method signum. This responsibility moved to evaluator.
Evaluator use dynamic filter:
1. interval arithmetic
2. if result interval has unrecognizable signum, use exact computation.

Created interface for line intersector strategy.
Created concreate strategy of intersector for Generic2D_Coordinates.
Intersect of point with line OK
Intersect of line with line - predicate part OK, constructive part under construction.