| Angle |
Utility functions for working with angles.
|
| Area |
Functions for computing area.
|
| BoundaryNodeRule.EndPointBoundaryNodeRule |
A BoundaryNodeRule which specifies that any points which are endpoints
of lineal components are in the boundary of the
parent geometry.
|
| BoundaryNodeRule.Mod2BoundaryNodeRule |
A BoundaryNodeRule specifies that points are in the
boundary of a lineal geometry iff
the point lies on the boundary of an odd number
of components.
|
| BoundaryNodeRule.MonoValentEndPointBoundaryNodeRule |
A BoundaryNodeRule which determines that only
endpoints with valency of exactly 1 are on the boundary.
|
| BoundaryNodeRule.MultiValentEndPointBoundaryNodeRule |
A BoundaryNodeRule which determines that only
endpoints with valency greater than 1 are on the boundary.
|
| Centroid |
Computes the centroid of a Geometry of any dimension.
|
| CGAlgorithms |
Deprecated.
|
| CGAlgorithmsDD |
Implements basic computational geometry algorithms using DD arithmetic.
|
| ConvexHull |
|
| Distance |
Functions to compute distance between basic geometric structures.
|
| HCoordinate |
Represents a homogeneous coordinate in a 2-D coordinate space.
|
| InteriorPoint |
Computes an interior point of a Geometry.
|
| InteriorPointArea |
Computes a point in the interior of an areal geometry.
|
| InteriorPointLine |
Computes a point in the interior of an linear geometry.
|
| InteriorPointPoint |
Computes a point in the interior of an point geometry.
|
| Length |
Functions for computing length.
|
| LineIntersector |
A LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do.
|
| Orientation |
Functions to compute the orientation of basic geometric structures
including point triplets (triangles) and rings.
|
| PointLocation |
Functions for locating points within basic geometric
structures such as lines and rings.
|
| PointLocator |
|
| RayCrossingCounter |
Counts the number of segments crossed by a horizontal ray extending to the right
from a given point, in an incremental fashion.
|
| RectangleLineIntersector |
Computes whether a rectangle intersects line segments.
|
| RobustLineIntersector |
|