Uses of Package
org.locationtech.jts.algorithm
Packages that use org.locationtech.jts.algorithm
Package
Description
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Classes to determine the topological location of points in geometries.
Contains the
Geometry
interface hierarchy and supporting classes.Contains classes that implement topology graphs.
Contains classes that implement indexes for performing noding on geometry graph edges.
Classes to compute nodings for arrangements of line segments and line segment sequences.
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
Provides classes for implementing operations on geometries
Provides classes for computing buffers of geometries
Provides classes for computing the distance between geometries
Contains classes that perform a topological overlay to compute boolean spatial functions.
Classes to validate the results of overlay operations.
Classes which implement topological predicates optimized for particular kinds of geometries.
Contains classes to implement the computation of the spatial relationships of
Geometry
s.Provides classes for testing the validity of geometries.
Classes which implement algorithms for simplifying or generalizing geometries.
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.algorithmClassDescriptionAn 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.Represents a homogeneous coordinate in a 2-D coordinate space.ALineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do.Indicates that aHCoordinate
has been computed which is not representable on the Cartesian plane. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.algorithm.locateClassDescriptionCounts the number of segments crossed by a horizontal ray extending to the right from a given point, in an incremental fashion.
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.geom
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.geomgraphClassDescriptionAn 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.ALineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.geomgraph.indexClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.nodingClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.noding.snaproundClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operationClassDescriptionAn 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.ALineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.bufferClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.distance
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.overlayClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.overlay.validate
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.predicate
-
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.relateClassDescriptionAn 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.ALineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.operation.validClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.simplifyClassDescriptionA
LineIntersector
is an algorithm that can both test whether two line segments intersect and compute the intersection point(s) if they do. -
Classes in org.locationtech.jts.algorithm used by org.locationtech.jts.triangulate.quadedge