Package | Description |
---|---|
org.locationtech.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
|
org.locationtech.jts.geomgraph |
Contains classes that implement topology graphs.
|
org.locationtech.jts.operation |
Provides classes for implementing operations on geometries
|
org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometry s. |
Modifier and Type | Class | Description |
---|---|---|
static class |
BoundaryNodeRule.EndPointBoundaryNodeRule |
A
BoundaryNodeRule which specifies that any points which are endpoints
of lineal components are in the boundary of the
parent geometry. |
static class |
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. |
static class |
BoundaryNodeRule.MonoValentEndPointBoundaryNodeRule |
A
BoundaryNodeRule which determines that only
endpoints with valency of exactly 1 are on the boundary. |
static class |
BoundaryNodeRule.MultiValentEndPointBoundaryNodeRule |
A
BoundaryNodeRule which determines that only
endpoints with valency greater than 1 are on the boundary. |
Modifier and Type | Field | Description |
---|---|---|
static BoundaryNodeRule |
BoundaryNodeRule.ENDPOINT_BOUNDARY_RULE |
The Endpoint Boundary Node Rule.
|
static BoundaryNodeRule |
BoundaryNodeRule.MOD2_BOUNDARY_RULE |
The Mod-2 Boundary Node Rule (which is the rule specified in the OGC SFS).
|
static BoundaryNodeRule |
BoundaryNodeRule.MONOVALENT_ENDPOINT_BOUNDARY_RULE |
The Monovalent Endpoint Boundary Node Rule.
|
static BoundaryNodeRule |
BoundaryNodeRule.MULTIVALENT_ENDPOINT_BOUNDARY_RULE |
The MultiValent Endpoint Boundary Node Rule.
|
static BoundaryNodeRule |
BoundaryNodeRule.OGC_SFS_BOUNDARY_RULE |
The Boundary Node Rule specified by the OGC Simple Features Specification,
which is the same as the Mod-2 rule.
|
Constructor | Description |
---|---|
PointLocator(BoundaryNodeRule boundaryRule) |
Modifier and Type | Method | Description |
---|---|---|
BoundaryNodeRule |
GeometryGraph.getBoundaryNodeRule() |
Modifier and Type | Method | Description |
---|---|---|
void |
EdgeEnd.computeLabel(BoundaryNodeRule boundaryNodeRule) |
|
static int |
GeometryGraph.determineBoundary(BoundaryNodeRule boundaryNodeRule,
int boundaryCount) |
This method implements the Boundary Determination Rule
for determining whether
a component (node or edge) that appears multiple times in elements
of a MultiGeometry is in the boundary or the interior of the Geometry
The SFS uses the "Mod-2 Rule", which this function implements An alternative (and possibly more intuitive) rule would be the "At Most One Rule": isInBoundary = (componentCount == 1) |
Constructor | Description |
---|---|
GeometryGraph(int argIndex,
Geometry parentGeom,
BoundaryNodeRule boundaryNodeRule) |
Modifier and Type | Method | Description |
---|---|---|
static Geometry |
BoundaryOp.getBoundary(Geometry g,
BoundaryNodeRule bnRule) |
Constructor | Description |
---|---|
BoundaryOp(Geometry geom,
BoundaryNodeRule bnRule) |
|
GeometryGraphOperation(Geometry g0,
Geometry g1,
BoundaryNodeRule boundaryNodeRule) |
|
IsSimpleOp(Geometry geom,
BoundaryNodeRule boundaryNodeRule) |
Creates a simplicity checker using a given
BoundaryNodeRule |
Modifier and Type | Method | Description |
---|---|---|
void |
EdgeEndBundle.computeLabel(BoundaryNodeRule boundaryNodeRule) |
This computes the overall edge label for the set of
edges in this EdgeStubBundle.
|
static IntersectionMatrix |
RelateOp.relate(Geometry a,
Geometry b,
BoundaryNodeRule boundaryNodeRule) |
Computes the
IntersectionMatrix for the spatial relationship
between two Geometry s using a specified Boundary Node Rule. |
Constructor | Description |
---|---|
EdgeEndBundle(BoundaryNodeRule boundaryNodeRule,
EdgeEnd e) |
|
RelateOp(Geometry g0,
Geometry g1,
BoundaryNodeRule boundaryNodeRule) |
Creates a new Relate operation with a specified Boundary Node Rule.
|
Copyright © 2018. All rights reserved.