Module Goals

This implementation is a project of Prof. Dr. Jackson Roehrig and Sanjay=
Dominik Jena of the University of Applied Sciences Cologne, Germany (Fachh=
ochschule Köln).

=20

We are implementing the Geometry of the ISO19107 with the following goal=
s and limitations:

=20

=20

implementation of the geometry objects (without TP_xxx topology). Limit=
ed to all classes except Solid/SolidBoundary, as well as to LineString/Line=
Segment as only implementation of CurveSegment.

=20

general longterm objective is an Implementation that handles 2D, 2.5D a=
nd 3D data. Storing data in all dimension is (obviously) not a problem. But=
there is vast difference between 2D and 3D spatial analyse operations.

=20

address the problem of limited memory, e.g. offer an interface for late=
r possibility of storing some geometry data in order to relieve the limited=
memory capabilities (for example a Factory which returns Lists os some GM_=
xxx objects, the list can be implemented persistent afterwards).

=20

in some parts we will reuse code of the Java Topology Suite (JTS) and a=
dopt to the Feature Geometry of the Abstract Specification. We do not &quot=
;wrap" JTS classes. We copy chosen classes of the JTS under GNU Lesser=
License and fit these code to our implementation (and try to eleminate red=
undancies).

=20

Publicate the implementation under GNU Lesser License terms in the GeoT=
ools project

=20

=20

As there aren´t existing too many approaches for a 19107 GeoAPI im=
plementation yet, this implementation will serve as a test of the capabilit=
y of the GeoAPI (in fact for TC211 too, since GeoAPI is partially derived f=
rom the TC211 specs) as well. Thus, we will report a list of suggestions to=
GeoAPI / GeoTools in order to contribute a part to the improvement of the =
GeoAPI by "Best Practise".

=20

Project Reports

Future

=20

Adrian =
Custer is looking into the larger problems of making ISO19107 Geometry =
implementation that can respond to the CoordianteReferenceSystem definition=
by delegating to a range of operations. This module uses linear solutions =
(ie 2D space) for operations such as buffer and intersects; when working wi=
th geometries defined by great circles on a sphere a different implementati=
on should be used.

=20

In more simple terms; we need to have a double dispatch using both Geome=
try and CRS in order to determine the correct operation to execute.