Package com.vividsolutions.jts.algorithm

Interface Summary

Interface	Description
BoundaryNodeRule	An interface for rules which determine whether node points which are in boundaries of Lineal geometry components are in the boundary of the parent geometry collection.
PointInRing	An interface for classes which test whether a Coordinate lies inside a ring.

Class Summary

Class	Description
Angle	Utility functions for working with angles.
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.
CentralEndpointIntersector	Deprecated
Centroid	Computes the centroid of a Geometry of any dimension.
CentroidArea	Deprecated use Centroid instead
CentroidLine	Deprecated use Centroid instead
CentroidPoint	Deprecated use Centroid instead
CGAlgorithms	Specifies and implements various fundamental Computational Geometric algorithms.
CGAlgorithms3D	Basic computational geometry algorithms for geometry and coordinates defined in 3-dimensional Cartesian space.
CGAlgorithmsDD	Implements basic computational geometry algorithms using DD arithmetic.
ConvexHull	Computes the convex hull of a Geometry.
HCoordinate	Represents a homogeneous coordinate in a 2-D coordinate space.
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.
LineIntersector	A LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do.
MCPointInRing	Implements PointInRing using MonotoneChains and a Bintree index to increase performance.
MinimumBoundingCircle	Computes the Minimum Bounding Circle (MBC) for the points in a Geometry.
MinimumDiameter	Computes the minimum diameter of a Geometry.
NonRobustCGAlgorithms	Non-robust versions of various fundamental Computational Geometric algorithms, FOR TESTING PURPOSES ONLY!.
NonRobustLineIntersector	A non-robust version of LineIntersector.
PointLocator	Computes the topological (Location) of a single point to a Geometry.
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.
RobustCGAlgorithms	Deprecated use CGAlgorithms instead
RobustDeterminant	Implements an algorithm to compute the sign of a 2x2 determinant for double precision values robustly.
RobustLineIntersector	A robust version of LineIntersector.
SimplePointInRing	Tests whether a Coordinate lies inside a ring, using a linear-time algorithm.

Exception Summary

Exception	Description
NotRepresentableException	Indicates that a HCoordinate has been computed which is not representable on the Cartesian plane.