db4o-sp Code-SVN

Implementation of API using Standard. Contains large majority of methods for each type. Some specification was customized for Java (generic types). Designed and implemented way of changes of geometries. Because of this, some methods were added, witch is not in standard. For example, in ST_LineString are methods addAllPoints, AddPoint, RemovePoint witch should be used for change of line. Method getPoints return unmodifiable list of points, where operation as add, remove are not allowed. Each geometry can contains parent which is notified about change to check feasibility of change (validity).

List of operations witch is not implemented (* will be implemented as soon as possible):
overlay, relate, *
distance,
length (curves)
isSimple (compoundCurve) *
isSimple (multiCurve)
area, centroid, pointOnSurface (surface)

Deep tested from API:
ST_Point,
ST_Curve,
ST_LineString,
ST_CompoundCurve

Some other changes...

Implementation of method isSimple in ST_LineString and testing it.

api package splited to api and api.geometry.
GeometryFactory places in api. Removed interface GeometryFactory. Now only class exists.
Each geometry contains GeometryFactory field.
Created graph operation configuration witch contains edge and line intersector, noder and rounder concrete strategies.
Repaired line intersector 2D test - method V2.

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.