|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
PreparedPolygon
relative to all other Geometry
classes.AffineTransformation
defined by three control points
and their images under the transformation.AssertionFailedException
.
AssertionFailedException
with the given detail
message.
Collection
of Geometry
s to be sequenced.
Geometry
to be sequenced.
DirectedEdge
which is known to form part of this ring.
Edge
to the subgraph.
Geometry
's
coordinates.
Geometry
's
CoordinateSequence
s.
Geometry
and its
subelement Geometry
s (if any).
PreparedGeometry
subclasses.BinTree
(or "Binary Interval Tree")
is a 1-dimensional version of a quadtree.Lineal
geometry components
are in the boundary of the parent geometry collection.BoundaryNodeRule
which specifies that any points which are endpoints
of lineal components are in the boundary of the
parent geometry.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
which determines that only
endpoints with valency of exactly 1 are on the boundary.BoundaryNodeRule
which determines that only
endpoints with valency greater than 1 are on the boundary.Geometry
.DirectedEdge
s and Node
s.InStream
.InStream
,
with the representation being in either common byte ordering.Geometry
, using enhanced precision.
Geometry
, MultiGeometry
, or
GeometryCollection
to contain the Geometry
s in
it.
Polygonal
geometrys.Geometry
s.
Geometry
s.
Geometry
s should be reshifted.
Coordinate
from each connected component of a Geometry
.Geometry
( Polygon
or MultiPolygon
)
is connected.Subgraph
s of a PlanarGraph
.GeometryGraph
representing an area
(a Polygon
or MultiPolygon
)
has consistent semantics for area geometries.GeometryGraph
are consistent.Geometry
.Geometry
.
Coordinate
array.
Coordinate
at (x,y,z).
Coordinate
at (0,0,NaN).
Coordinate
having the same (x,y,z) values as
other
.
Coordinate
at (x,y,NaN).
Coordinate
s, allowing for either a 2-dimensional
or 3-dimensional comparison, and handling NaN values correctly.CoordinateFilter
that creates an array containing every
coordinate in a Geometry
.CoordinateArrayFilter
.
CoordinateSequence
implementation that Geometry
s use by default.Coordinate
s.
CoordinateSequence
s represented as an array of Coordinate
s.Comparator
for Coordinate
arrays
modulo their directionality.Comparator
for Coordinate
arrays
in the forward direction of their coordinates,
using lexicographic ordering.CoordinateFilter
that counts the total number of coordinates
in a Geometry
.Geometry
classes support the concept of applying a
coordinate filter to every coordinate in the Geometry
.Coordinate
s, which may
be set to prevent repeated coordinates from occuring in the list.CoordinateSequence
s.CoordinateSequence
s.CoordinateSequence
.CoordinateSequence
sg
's class is GeometryCollection
.
Edge
s
are correctly noded.
Geometry
.
Geometry
object
(including all coordinates contained by it).
GeometryCollection
object.
LineString
object.
Point
object.
Polygon
object.
Geometry
interface hierarchy and supporting classes.Geometry
s.double
s, allowing for NaN values.
Coordinate
s along to the number of
dimensions specified.
Coordinate
arrays
in the forward direction of their coordinates,
using lexicographic ordering.
double
s, allowing for NaN values.
CoordinateSequence
s for relative order.
compareTo
encountered as
the two Collection
s are iterated over.
Coordinate
s for their relative position along a segment
lying in the specified Octant
.
CoordinateSequence
s
along the given number of dimensions.
Coordinate
with the specified Coordinate
for order.
Geometry
is greater than, equal to,
or less than another Geometry
.
Geometry
is greater than, equal to,
or less than another Geometry
,
using the given CoordinateSequenceComparator
.
PrecisionModel
object with the specified object for order.
OrientedCoordinateArray
s for their relative order
Geometry
is greater than, equal to,
or less than another Geometry
having the same class.
Geometry
is greater than, equal to,
or less than another Geometry
of the same class.
AffineTransformation
.
AffineTransformation
with this transformation.
Geometry
, or a null Envelope
if this Geometry
is empty.
SegmentStrings
, i.e.
SegmentString
s.
SegmentString
s.
Envelope other
lies wholely inside this Envelope
(inclusive of the boundary).
Geometry
contains a given geometry.
PreparedPolygon
and a Geometry
.
Edge
DirectedEdge
Edge
is contained in this subgraph
Geometry
contains a given geometry.
PreparedPolygon
and a Geometry
.
Polygon
that contains all the
points in the Geometry
.
CoordinateSequence
s
Geometry
is covered by a given geometry.
Envelope other
lies wholely inside this Envelope
(inclusive of the boundary).
Geometry
covers a given geometry.
PreparedPolygon
and a Geometry
.
CoordinateSequence
based on the given array.
CoordinateSequence
which is a copy
of the given CoordinateSequence
.
CoordinateSequence
of the specified size and dimension.
CoordinateArraySequence
based on the given array (the array is
not copied).
PreparedGeometry
appropriate for the argument Geometry
.
Polygon
.
CoordinateSequence
MultiPoint
using the given Coordinate
s.
Polygon
with the given exterior boundary and
interior boundaries.
Polygon
.
Geometry
crosses a given geometry.
PlanarGraph
.from
node to the
to
node.
DirectedEdge
s which leave a Node
in a PlanarGraph
.Geometry
s which lie
within a given distance, or else are the closest points
on the geometries (in which case this also
provides the distance between the geometries).Geometry
using the standard Douglas-Peucker algorithm.Geometry
representing the points making up this
Geometry
that do not make up other
.
Geometry
s, using enhanced precision.
Geometry
s, using enhanced precision.
Iterator
over the DirectedEdge
s in this graph,
in the order in which they were added.
Geometry
is disjoint from a given geometry.
SegmentString
s in the input Collection
SegmentString
.
Envelope
.
Geometry
and the Geometry
g
PlanarGraph
.EdgeEnd
s which arise from a noded Edge
.EdgeEnd
s which obey the following invariant:
They originate at the same node and have the same direction.EdgeEndBundle
s around a RelateNode
.Edge
.Edge
s is correctly noded.Edge
s.
PolygonizeDirectedEdge
s which form
a ring of a polygon.LineMergeDirectedEdge
s forming one of the lines that will
be output by the line-merging process.Envelope
.
Envelope
for a region defined by maximum and minimum values.
Envelope
for a region defined by two Coordinates.
Envelope
for a region defined by a single Coordinate.
Envelope
from an existing Envelope.
Iterator
over the Edge
s in this graph,
in the order in which they were added.
Coordinate
s from a Geometry
.
Geometry
with the given edit operation.
Geometry
.
true
if other
has the same values for
the x and y ordinates.
CoordinateArrays.ForwardComparator
for Coordinate
s
true
if other
has the same values for
its points.
AssertionFailedException
if the given objects are
not equal, according to the equals
method.
AssertionFailedException
with the given message if
the given objects are not equal, according to the equals
method.
Coordinate
s
are equal.
true
if other
has the same values for x,
y and z.
Geometry
s are exactly equal,
up to a specified distance tolerance.
Geometry
s are exactly equal.
true
if other
is
topologically equal to this LineSegment (e.g.
Envelope
to include the coordinates in the sequence.
Envelope
so that it contains
(x,y).
Envelope
so that it contains
(x,y).
Envelope
so that it contains
other
.
Coordinate
array
from indices start
to
end
(inclusive).
LineString
elements from a single Geometry
and adds them to the provided List
.
LineString
elements from a single Geometry
and returns them in a List
.
LineString
for the interval
on the line between the given indices.
LineString
for the interval
on the line between the given indices.
Coordinate
for the point
on the line at the given index.
Coordinate
for the point
on the line at the given index.
Geometry
to SegmentString
s.
SegmentString
s is correctly noded.SegmentStrings
s intersect.Location
of a point relative to
the polygonal components of a geometry, using a tolerance value.GeometryFactory
used to create this Geometry
coord
.
CoordinateSequence
.
geom
.
geom
.
Node
at the given location,
or null if no Node
was there.
GeometryFactory
.
GeometryFactory
.
GeometryCollection
.Geometry
s in a GeometryCollection
.GeometryCollection
.
Geometry
s
to produce a GeometryCollection
of the most appropriate type.Geometry
classes support the concept of applying
a GeometryComponentFilter
filter to the Geometry
.Geometry
s
which are modifications of existing ones.Geometry
with the same GeometryFactory
as the input Geometry.
GeometryFactory
GeometryEditorOperation
which modifies the coordinate list of a Geometry
.LineString
elements from a Geometry
.PrecisionModel
and the default CoordinateSequence
implementation.
PrecisionModel
and spatial-reference ID, and the default CoordinateSequence
implementation.
GeometryCollection
classes support the concept of
applying a GeometryFilter
to the Geometry
.GeometryGraph
s.Geometry
to another Geometry's vertices.Geometry
into
an output Geometry
, possibly changing its structure and type(s).GeometryCollection
.
IntersectionMatrix
s
elements.
Geometry
.
GeometryCollection
Polygon
Geometry
is empty.
Geometry
s inherent boundary.
Dimension.FALSE
, since by definition LinearRings do
not have a boundary.
Geometry
.
MonotoneChain
s
for the given list of coordinates.
GraphComponent
in a Iterator
set
which has the specified visited state.
Geometry
that represents the convex hull of the input
geometry.
Coordinate
.
Geometry
.
Coordinate
at the given position.
Coordinate
along the
given linear Geometry
which is
referenced by this location.
Geometry
containing the error).
Geometry
s vertices.
Coordinate
s.
Coordinate
s.
LineString
which is a minimum diameter
Geometry
.
DirectedEdge
that starts from the given node, or null if the
node is not one of the two nodes associated with this Edge.
Geometry
.
Geometry
s bounding box.
Geometry
, or a null Envelope
if this Geometry
is empty.
Geometry
which has been prepared.
Geometry
from a GeometryCollection
(or this
, if the geometry is not a collection).
com.vivid.jts.geom
interface.
Geometry
.
Geometry
.
LineString
Polygon
LinearLocation
on a linear Geometry
.
LineString
component the iterator is current at.
LineString
.
LineString
elements from a single Geometry
and adds them to the provided List
.
LineString
elements from a single Geometry
and returns them in a List
.
Location
of the point relative to
the ring, polygon
or multipolygon from which the processed segments were provided.
LinearLocation
for a
given length along a linear Geometry
.
LinearLocation
corresponding to a length.
Envelope
s maximum x-value.
Envelope
s maximum y-value.
Envelope
s minimum x-value.
Envelope
s minimum y-value.
Collection
of fully noded SegmentStrings
.
Collection
of fully noded SegmentStrings
.
Geometry
s in a GeometryCollection
(or 1, if the geometry is not a collection).
Geometry
s vertices.
node
is one of the two nodes associated with this Edge,
returns the other node; otherwise returns null.
PlanarGraph
which this subgraph
is part of.
Point
elements from a single Geometry
and adds them to the provided List
.
Point
elements from a single Geometry
and returns them in a List
.
Polygon
formed by this ring and any contained holes.
Polygon
elements from a single Geometry
and adds them to the provided List
.
Polygon
elements from a single Geometry
and returns them in a List
.
PrecisionModel
used by the Geometry
.
LinearRing
, or null if an Exception occurs while
creating it (such as a topology problem).
Geometry
.
LineSegment
representing the segment of the
given linear Geometry
which contains this location.
Coordinate
of the current segment.
index
.
index
.
Coordinate
of the current segment.
LineString
or MultiLineString
built by the sequencing process, if one exists.
AffineTransformation
determined by the control point mappings,
or null
if the control points do not determine a unique transformation.
Coordinate
forming one end of the minimum diameter
Geometry
s.
null
elements.
X
or Y
ordinate of
a Coordinate is not a valid numeric value (e.g.
Coordinate
s relative to
a Polygonal
geometry, using indexing for efficiency.Geometry
Coordinate
s relative to
a Polygonal
geometry, using indexing for efficiency.Geometry
InputStream
to be used as an InStream
SegmentString
s,
if one exists.SegmentString
s
and adds them to each string.IntersectionMatrix
with FALSE
dimension values.
IntersectionMatrix
with the given dimension
symbols.
IntersectionMatrix
with the same elements as
other
.
Geometry
is simple.BoundaryNodeRule
isValid()
method
for Geometry
s.Coordinate
array
is (overall) increasing.
coordinate
in coordinates
.
Envelope
.
Envelope
for a region defined by maximum and minimum values.
Envelope
to a region defined by two Coordinates.
Envelope
to a region defined by a single Coordinate.
Envelope
from an existing Envelope.
Envelope
to the index
CoordinateArraySequenceFactory
Envelopes
Geometry
representing the points shared by this
Geometry
and other
.
PreparedLineString
and a Geometry
.
Geometry
s, using enhanced precision.
Geometry
s, using enhanced precision.
other
overlaps (intersects) the region of this Envelope
.
p
overlaps (lies inside) the region of this Envelope
.
(x, y)
overlaps (lies inside) the region of this Envelope
.
Geometry
intersects a given geometry.
PreparedLineString
and a Geometry
.
Geometry
.
PreparedPolygon
and a Geometry
.
Coordinate
s is
oriented counter-clockwise.
Coordinate
is
oriented counter-clockwise.
IntersectionMatrix
is
T*****FF*.
LineString
.
true
if this IntersectionMatrix
is
T*F**F***
or *TF**F***
or **FT*F***
or **F*TF***
true
if this IntersectionMatrix
is
T*****FF*
or *T****FF*
or ***T**FF*
or ****T*FF*
true
if this IntersectionMatrix
is
FF*FF****.
Geometry
is
empty.
true
if this IntersectionMatrix
is
T*F**FFF*.
Geometry
s are equal, from the point
of view of the equalsExact
method.
true
if isDisjoint
returns false.
true
if this Envelope
is a "null"
envelope.
Geometry
.
true
if this IntersectionMatrix
is
T*T***T** (for two points or two surfaces)
1*T***T** (for two curves)
.
Coordinate
is
oriented counter-clockwise.
Geometry
is sequenced correctly.
Geometry
is simple.
true
, since by definition LinearRings are always simple.
true
if this IntersectionMatrix
is
FT*******, F**T***** or F***T****.
AssertionFailedException
if the given assertion is
not true.
AssertionFailedException
with the given message if
the given assertion is not true.
Geometry
.
Geometry
.
LinearRing
ring formed by this edge ring is topologically valid.
IntersectionMatrix
is
T*F**F***.
Geometry
to another is less than or equal to a specified value.
EdgeIntersection
s
Label
indicates the topological relationship of a component
of a topology graph to a given Geometry
.Geometry
using the length along the line as the index.Geometry
to be linearly referenced using length as an index.
LinearLocation
for a given length
along a linear Geometry
.DirectedEdge
s
created by an OverlayOp
.SegmentString
s
and adds them to each string.DirectedEdge
of a
LineMergeGraph
.from
node to the
to
node.
LineMergeGraph
.Coordinate
s.LineSegment
s.LineString
.LineString
elements from a Geometry
.LineString
to a set of target snap vertices.LineString
as source snap points.
Geometry
subclasses which
are 1-dimensional and have components which are LineStrings
.LineString
) components from a Geometry
.LineString
or MultiLineString
)
incrementally (point-by-point).LineString
s and MultiLineString
s.Geometry
LinearLocation
on a linear Geometry
Geometry
LineString
or MultiLineString
.LinearRing
.LinearRing
with the vertices
specifed by the given CoordinateSequence
.
Geometry
using LinearLocation
s as the index.Geometry
.
Location
of a point in an areal Geometry
.
Location
of a point in an areal Geometry
.
Location
) of a single point
to a Geometry.
Location
of a point in an areal Geometry
.
Location
of a point in an areal Geometry
.
Location
of a point in an areal Geometry
.
Location
of a point in an areal Geometry
.
Location
of a point in a ring.
SegmentStrings
using a index based
on MonotoneChain
s and a SpatialIndex
.SegmentString
s in a SpatialIndex
containing
MonotoneChain
s to a given HotPixel
.SegmentStrings
using a index based
on MonotoneChain
s and a SpatialIndex
.SegmentString
s.PointInRing
using MonotoneChain
s and a BinTree
index to
increase performance.DirectedEdge
s which may contain nodes of degree > 2.Edge
s with the property that no node
has degree greater than 2.Geometry
.Geometry
.
Geometry
,
with a hint if
the Geometry is convex
(e.g.
MonotoneChain
s
for sequences of Coordinate
s.MultiLineString
.Point
s.MultiPolygon
.IntersectionMatrix
satisfies the required dimension symbols.
PrecisionModel
s is the most precise
(allows the greatest number of significant digits).
Bintree
.Quadtree
.PlanarGraph
is a location where 0 or more Edge
s
meet.Bintree
.Quadtree
.Node
s, indexed by the coordinate of the node.SegmentString
s.SegmentString
s is correctly noded.AffineTransformation
is non-invertible.HCoordinate
has been computed which is
not representable on the Cartesian plane.Iterator
over the Node
s in this graph.
Geometry
to normal form (or
canonical form ).
Coordinate
Coordinate
s
Envelope
OctagonalEnvelope
(the copy constructor).
Geometry
Geometry
component (ring, line or point).Geometry
.Geometry
.Coordinate
arrays
in an orientation-independent way.OrientedCoordinateArray
for the given Coordinate
array.
OutputStream
to be used as an OutStream
PlanarGraph
s constructed during
overlay operations.Geometry
s.q
relative to a
vector specified by p1-p2
.
Coordinate
relative to this segment.
Geometry
overlaps a given geometry.
CoordinateSequence
implementation based on a packed arrays.floats
- PackedCoordinateSequence.Float(double[], int) -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequence.Float
- Constructs a packed coordinate sequence from an array of
doubles
- PackedCoordinateSequence.Float(Coordinate[], int) -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequence.Float
- Constructs a packed coordinate sequence out of a coordinate array
- PackedCoordinateSequence.Float(int, int) -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequence.Float
- Constructs an empty packed coordinate sequence of a given size and dimension
- PackedCoordinateSequenceFactory - class com.vividsolutions.jts.geom.impl.PackedCoordinateSequenceFactory.
- Builds packed array coordinate sequences.
- PackedCoordinateSequenceFactory() -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequenceFactory
- Creates a new PackedCoordinateSequenceFactory
of type DOUBLE.
- PackedCoordinateSequenceFactory(int) -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequenceFactory
- Creates a new PackedCoordinateSequenceFactory
of the given type.
- PackedCoordinateSequenceFactory(int, int) -
Constructor for class com.vividsolutions.jts.geom.impl.PackedCoordinateSequenceFactory
- Creates a new PackedCoordinateSequenceFactory
of the given type.
- ParseException - exception com.vividsolutions.jts.io.ParseException.
- Thrown by a
WKTReader
when a parsing problem occurs. - ParseException(String) -
Constructor for class com.vividsolutions.jts.io.ParseException
- Creates a
ParseException
with the given detail message.
- ParseException(Exception) -
Constructor for class com.vividsolutions.jts.io.ParseException
- Creates a
ParseException
with e
s detail message.
- PlanarGraph - class com.vividsolutions.jts.geomgraph.PlanarGraph.
- The computation of the
IntersectionMatrix
relies on the use of a structure
called a "topology graph". - PlanarGraph(NodeFactory) -
Constructor for class com.vividsolutions.jts.geomgraph.PlanarGraph
-
- PlanarGraph() -
Constructor for class com.vividsolutions.jts.geomgraph.PlanarGraph
-
- PlanarGraph - class com.vividsolutions.jts.planargraph.PlanarGraph.
- Represents a directed graph which is embeddable in a planar surface.
- PlanarGraph() -
Constructor for class com.vividsolutions.jts.planargraph.PlanarGraph
- Constructs a empty graph.
- Point - class com.vividsolutions.jts.geom.Point.
- Basic implementation of
Point
. - Point(Coordinate, PrecisionModel, int) -
Constructor for class com.vividsolutions.jts.geom.Point
- Deprecated. Use GeometryFactory instead
- Point(CoordinateSequence, GeometryFactory) -
Constructor for class com.vividsolutions.jts.geom.Point
-
- PointBuilder - class com.vividsolutions.jts.operation.overlay.PointBuilder.
- Constructs
Point
s from the nodes of an overlay graph. - PointBuilder(OverlayOp, GeometryFactory, PointLocator) -
Constructor for class com.vividsolutions.jts.operation.overlay.PointBuilder
-
- PointExtracter - class com.vividsolutions.jts.geom.util.PointExtracter.
- Extracts all the 0-dimensional (
Point
) components from a Geometry
. - PointExtracter(List) -
Constructor for class com.vividsolutions.jts.geom.util.PointExtracter
- Constructs a PointExtracterFilter with a list in which to store Points found.
- PointInAreaLocator - interface com.vividsolutions.jts.algorithm.PointInAreaLocator.
- An interface for classes which determine the
Location
of
points in areal geometries. - PointInRing - interface com.vividsolutions.jts.algorithm.PointInRing.
- An interface for classes which test whether a
Coordinate
lies inside
a ring. - PointLocator - class com.vividsolutions.jts.algorithm.PointLocator.
- Computes the topological relationship (
Location
)
of a single point to a Geometry
. - PointLocator() -
Constructor for class com.vividsolutions.jts.algorithm.PointLocator
-
- PointLocator(BoundaryNodeRule) -
Constructor for class com.vividsolutions.jts.algorithm.PointLocator
-
- PointOnGeometryLocator - interface com.vividsolutions.jts.algorithm.locate.PointOnGeometryLocator.
- An interface for classes which determine the
Location
of
points in areal geometries. - Polygon - class com.vividsolutions.jts.geom.Polygon.
- Represents a linear polygon, which may include holes.
- Polygon(LinearRing, PrecisionModel, int) -
Constructor for class com.vividsolutions.jts.geom.Polygon
- Deprecated. Use GeometryFactory instead
- Polygon(LinearRing, LinearRing[], PrecisionModel, int) -
Constructor for class com.vividsolutions.jts.geom.Polygon
- Deprecated. Use GeometryFactory instead
- Polygon(LinearRing, LinearRing[], GeometryFactory) -
Constructor for class com.vividsolutions.jts.geom.Polygon
- Constructs a
Polygon
with the given exterior boundary and
interior boundaries.
- PolygonBuilder - class com.vividsolutions.jts.operation.overlay.PolygonBuilder.
- Forms
Polygon
s out of a graph of DirectedEdge
s. - PolygonBuilder(GeometryFactory, CGAlgorithms) -
Constructor for class com.vividsolutions.jts.operation.overlay.PolygonBuilder
-
- PolygonExtracter - class com.vividsolutions.jts.geom.util.PolygonExtracter.
- Extracts all the
Polygon
elements from a Geometry
. - PolygonExtracter(List) -
Constructor for class com.vividsolutions.jts.geom.util.PolygonExtracter
- Constructs a PolygonExtracterFilter with a list in which to store Polygons found.
- Polygonal - interface com.vividsolutions.jts.geom.Polygonal.
- Identifies
Geometry
subclasses which
are 2-dimensional
and have components which have Lineal
boundaries. - PolygonizeDirectedEdge - class com.vividsolutions.jts.operation.polygonize.PolygonizeDirectedEdge.
- A
DirectedEdge
of a PolygonizeGraph
, which represents
an edge of a polygon formed by the graph. - PolygonizeDirectedEdge(Node, Node, Coordinate, boolean) -
Constructor for class com.vividsolutions.jts.operation.polygonize.PolygonizeDirectedEdge
- Constructs a directed edge connecting the
from
node to the
to
node.
- Polygonizer - class com.vividsolutions.jts.operation.polygonize.Polygonizer.
- Polygonizes a set of Geometrys which contain linework that
represents the edges of a planar graph.
- Polygonizer() -
Constructor for class com.vividsolutions.jts.operation.polygonize.Polygonizer
- Create a polygonizer with the same
GeometryFactory
as the input Geometry
s
- Position - class com.vividsolutions.jts.geomgraph.Position.
- A Position indicates the position of a Location relative to a graph component
(Node, Edge, or Area).
- Position() -
Constructor for class com.vividsolutions.jts.geomgraph.Position
-
- PrecisionModel - class com.vividsolutions.jts.geom.PrecisionModel.
- Specifies the precision model of the
Coordinate
s in a Geometry
. - PrecisionModel() -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel
- Creates a
PrecisionModel
with a default precision
of FLOATING.
- PrecisionModel(PrecisionModel.Type) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel
- Creates a
PrecisionModel
that specifies
an explicit precision model type.
- PrecisionModel(double, double, double) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel
- Deprecated. offsets are no longer supported, since internal representation is rounded floating point
- PrecisionModel(double) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel
- Creates a
PrecisionModel
that specifies Fixed precision.
- PrecisionModel(PrecisionModel) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel
- Copy constructor to create a new
PrecisionModel
from an existing one.
- PrecisionModel.Type - class com.vividsolutions.jts.geom.PrecisionModel.Type.
- The types of Precision Model which JTS supports.
- PrecisionModel.Type(String) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel.Type
-
- PreparedGeometry - interface com.vividsolutions.jts.geom.prep.PreparedGeometry.
- An interface for classes which prepare
Geometry
s
in order to optimize the performance
of repeated calls to specific geometric operations. - PreparedGeometryFactory - class com.vividsolutions.jts.geom.prep.PreparedGeometryFactory.
- A factory for creating
PreparedGeometry
s. - PreparedGeometryFactory() -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedGeometryFactory
-
- PreparedLineString - class com.vividsolutions.jts.geom.prep.PreparedLineString.
- A prepared version for
Lineal
geometries. - PreparedLineString(Lineal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedLineString
-
- PreparedLineStringIntersects - class com.vividsolutions.jts.geom.prep.PreparedLineStringIntersects.
- Computes the intersects spatial relationship predicate
for a target
PreparedLineString
relative to other Geometry
classes. - PreparedLineStringIntersects(PreparedLineString) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedLineStringIntersects
- Creates an instance of this operation.
- PreparedPoint - class com.vividsolutions.jts.geom.prep.PreparedPoint.
- A prepared version for
Puntal
geometries. - PreparedPoint(Puntal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPoint
-
- PreparedPolygon - class com.vividsolutions.jts.geom.prep.PreparedPolygon.
- A prepared version for
Polygonal
geometries. - PreparedPolygon(Polygonal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygon
-
- PreparedPolygonContains - class com.vividsolutions.jts.geom.prep.PreparedPolygonContains.
- Computes the contains spatial relationship predicate
for a
PreparedPolygon
relative to all other Geometry
classes. - PreparedPolygonContains(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonContains
- Creates an instance of this operation.
- PreparedPolygonContainsProperly - class com.vividsolutions.jts.geom.prep.PreparedPolygonContainsProperly.
- Computes the containsProperly spatial relationship predicate
for
PreparedPolygon
s relative to all other Geometry
classes. - PreparedPolygonContainsProperly(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonContainsProperly
- Creates an instance of this operation.
- PreparedPolygonCovers - class com.vividsolutions.jts.geom.prep.PreparedPolygonCovers.
- Computes the covers spatial relationship predicate
for a
PreparedPolygon
relative to all other Geometry
classes. - PreparedPolygonCovers(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonCovers
- Creates an instance of this operation.
- PreparedPolygonIntersects - class com.vividsolutions.jts.geom.prep.PreparedPolygonIntersects.
- Computes the intersects spatial relationship predicate
for
PreparedPolygon
s relative to all other Geometry
classes. - PreparedPolygonIntersects(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonIntersects
- Creates an instance of this operation.
- PreparedPolygonLineIntersection - class com.vividsolutions.jts.geom.prep.PreparedPolygonLineIntersection.
- Computes the intersection spatial overlay function
for a target
PreparedLineString
relative to other Geometry
classes. - PreparedPolygonLineIntersection(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonLineIntersection
- Creates an instance of this operation.
- PreparedPolygonPredicate - class com.vividsolutions.jts.geom.prep.PreparedPolygonPredicate.
- A base class for predicate operations on
PreparedPolygon
s. - PreparedPolygonPredicate(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonPredicate
- Creates an instance of this operation.
- Puntal - interface com.vividsolutions.jts.geom.Puntal.
- Identifies
Geometry
subclasses which
are 0-dimensional and with components which are Points
. - p0 -
Variable in class com.vividsolutions.jts.geom.LineSegment
-
- p0 -
Variable in class com.vividsolutions.jts.geom.Triangle
- The coordinates of the vertices of the triangle
- p0 -
Variable in class com.vividsolutions.jts.planargraph.DirectedEdge
-
- p1 -
Variable in class com.vividsolutions.jts.geom.LineSegment
-
- p1 -
Variable in class com.vividsolutions.jts.geom.Triangle
- The coordinates of the vertices of the triangle
- p1 -
Variable in class com.vividsolutions.jts.planargraph.DirectedEdge
-
- p2 -
Variable in class com.vividsolutions.jts.geom.Triangle
- The coordinates of the vertices of the triangle
- pa -
Variable in class com.vividsolutions.jts.algorithm.LineIntersector
-
- parentEdge -
Variable in class com.vividsolutions.jts.planargraph.DirectedEdge
-
- parentGraph -
Variable in class com.vividsolutions.jts.planargraph.Subgraph
-
- pb -
Variable in class com.vividsolutions.jts.algorithm.LineIntersector
-
- perpendicularBisector(Coordinate, Coordinate) -
Static method in class com.vividsolutions.jts.geom.Triangle
- Computes the line which is the perpendicular bisector of the
line segment a-b.
- pointAlong(double) -
Method in class com.vividsolutions.jts.geom.LineSegment
- Computes the
Coordinate
that lies a given
fraction along the line defined by this segment.
- pointAlongOffset(double, double) -
Method in class com.vividsolutions.jts.geom.LineSegment
- Computes the
Coordinate
that lies a given
fraction along the line defined by this segment and offset from
the segment by a given distance.
- pointAlongSegmentByFraction(Coordinate, Coordinate, double) -
Static method in class com.vividsolutions.jts.linearref.LinearLocation
- Computes the
Coordinate
of a point a given fraction
along the line segment (p0, p1).
- polyList -
Variable in class com.vividsolutions.jts.operation.polygonize.Polygonizer
-
- powerOf2(int) -
Static method in class com.vividsolutions.jts.index.quadtree.DoubleBits
-
- precisionModel -
Variable in class com.vividsolutions.jts.algorithm.LineIntersector
- If makePrecise is true, computed intersection coordinates will be made precise
using Coordinate#makePrecise
- prepLine -
Variable in class com.vividsolutions.jts.geom.prep.PreparedLineStringIntersects
-
- prepPoly -
Variable in class com.vividsolutions.jts.geom.prep.PreparedPolygonLineIntersection
-
- prepPoly -
Variable in class com.vividsolutions.jts.geom.prep.PreparedPolygonPredicate
-
- prepare(Geometry) -
Static method in class com.vividsolutions.jts.geom.prep.PreparedGeometryFactory
- Creates a new
PreparedGeometry
appropriate for the argument Geometry
.
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.DirectedEdge
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.DirectedEdgeStar
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.Edge
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.EdgeEnd
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.EdgeEndStar
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.EdgeIntersection
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.EdgeIntersectionList
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.EdgeList
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.Node
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.NodeMap
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.noding.SegmentNode
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.noding.SegmentNodeList
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.operation.relate.EdgeEndBundle
-
- print(PrintStream) -
Method in class com.vividsolutions.jts.planargraph.DirectedEdge
- Prints a detailed string representation of this DirectedEdge to the given PrintStream.
- print(String) -
Static method in class com.vividsolutions.jts.util.Debug
-
- print(Object) -
Static method in class com.vividsolutions.jts.util.Debug
-
- print(boolean, Object) -
Static method in class com.vividsolutions.jts.util.Debug
-
- printEdge(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.DirectedEdge
-
- printEdges(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.PlanarGraph
-
- printIfWatch(Object) -
Static method in class com.vividsolutions.jts.util.Debug
-
- printReverse(PrintStream) -
Method in class com.vividsolutions.jts.geomgraph.Edge
-
- printWatch() -
Static method in class com.vividsolutions.jts.util.Debug
-
- println(Object) -
Static method in class com.vividsolutions.jts.util.Debug
-
- println() -
Method in class com.vividsolutions.jts.util.Debug
-
- process(Collection) -
Method in class com.vividsolutions.jts.noding.MCIndexSegmentSetMutualIntersector
-
- process(Collection) -
Method in class com.vividsolutions.jts.noding.SegmentSetMutualIntersector
- Computes the intersections for two collections of
SegmentString
s.
- process(Collection) -
Method in class com.vividsolutions.jts.noding.SimpleSegmentSetMutualIntersector
-
- processIntersections(SegmentString, int, SegmentString, int) -
Method in class com.vividsolutions.jts.geom.prep.LineIntersectionAdder
- This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the SegmentStrings
being intersected.
- processIntersections(SegmentString, int, SegmentString, int) -
Method in class com.vividsolutions.jts.noding.InteriorIntersectionFinder
- This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the SegmentStrings
being intersected.
- processIntersections(SegmentString, int, SegmentString, int) -
Method in class com.vividsolutions.jts.noding.IntersectionAdder
- This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the SegmentStrings
being intersected.
- processIntersections(SegmentString, int, SegmentString, int) -
Method in class com.vividsolutions.jts.noding.IntersectionFinderAdder
- This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the SegmentStrings
being intersected.
- processIntersections(SegmentString, int, SegmentString, int) -
Method in class com.vividsolutions.jts.noding.SegmentIntersectionDetector
- This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the SegmentStrings
being intersected.
- processIntersections(SegmentString, int, SegmentString, int) -
Method in interface com.vividsolutions.jts.noding.SegmentIntersector
- This method is called by clients
of the
SegmentIntersector
interface to process
intersections for two segments of the SegmentStrings
being intersected.
- project(Coordinate) -
Method in class com.vividsolutions.jts.geom.LineSegment
- Compute the projection of a point onto the line determined
by this line segment.
- project(LineSegment) -
Method in class com.vividsolutions.jts.geom.LineSegment
- Project a line segment onto this line segment and return the resulting
line segment.
- project(Coordinate) -
Method in class com.vividsolutions.jts.linearref.LengthIndexedLine
- Computes the index for the closest point on the line to the given point.
- project(Coordinate) -
Method in class com.vividsolutions.jts.linearref.LocationIndexedLine
- Computes the index for the closest point on the line to the given point.
- projectionFactor(Coordinate) -
Method in class com.vividsolutions.jts.geom.LineSegment
- Computes the Projection Factor for the projection of the point p
onto this LineSegment.
- pt -
Variable in class com.vividsolutions.jts.planargraph.Node
- The location of this Node
- ptNotInList(Coordinate[], Coordinate[]) -
Static method in class com.vividsolutions.jts.geom.CoordinateArrays
- Finds a point in a list of points which is not contained in another list of points
- ptNotInList(Coordinate[], Coordinate[]) -
Static method in class com.vividsolutions.jts.operation.polygonize.EdgeRing
- Finds a point in a list of points which is not contained in another list of points
- putDouble(double, byte[], int) -
Static method in class com.vividsolutions.jts.io.ByteOrderValues
-
- putInt(int, byte[], int) -
Static method in class com.vividsolutions.jts.io.ByteOrderValues
-
- putLong(long, byte[], int) -
Static method in class com.vividsolutions.jts.io.ByteOrderValues
-
LinearRing
s are
nested inside another ring in the set, using a Quadtree
index to speed up the comparisons.Envelope
Note that some kinds of indexes may also return objects which do not in fact
intersect the query envelope.
Envelope
,
and applies an ItemVisitor
to them.
Geometry
is a rectangle.Geometry
is a rectangle.NodeMap
in a RelateNodeGraph
to create RelateNode
s.Geometry
s.Bintree
.buf.length
bytes from the input stream
and stores them in the supplied buffer.
Geometry
from a byte array.
Geometry
from an {@link InStream).
Geometry
from a String
.
Geometry
from a Reader
.
IntersectionMatrix
for the two Geometry
s match the elements in intersectionPattern
.
IntersectionMatrix
for the two Geometry
s.
IntersectionMatrix
for the spatial relationship
between two Geometry
s, using the default (OGC SFS) Boundary Node Rule
IntersectionMatrix
for the spatial relationship
between two Geometry
s using a specified Boundary Node Rule.
DirectedEdge
incident on this node.
Edge
and its associated DirectedEdge
s
from their from-Nodes and from the graph.
DirectedEdge
from its from-Node
and from this graph.
LineString
whose coordinates are in the reverse
order of this objects
MultiLineString
in the reverse
order to this object.
Geometry
Noder
and transforms its input
into the integer domain.SegmentString
s,
if one exists.CoordinateSequence
s intersect.Noder
.SegmentString
s.SegmentNode
s present along a noded SegmentString
.SegmentString
s to produce
a set of merged linework with unique segments.SegmentString
s.Geometry
elements which can
be short-circuited by a given conditionGeometry
according to the supplied PrecisionModel
, without
attempting to preserve valid topology.LinearRing
s are
nested inside another ring in the set, using a simple O(n^2)
comparison.SegmentString
s by
performing a brute-force comparison of every segment to every other one.Geometry
,
using a simple O(n) algorithm.Geometry
,
using a simple O(n) algorithm.Coordinate
lies inside
a ring, using a linear-time algorithm.SegmentStrings
using
brute-force comparasion.SegmentString
s.GeometryFactory
.
GeometryFactory
.
Noder
s which make a single
pass to find intersections.PlanarGraph
.PlanarGraph
SweepLineIndex
detects that two
SweepLineInterval
s overlapLinearRing
s are
nested inside another ring in the set, using a SweepLineIndex
index to speed up the comparisons.firstCoordinate
is first.
Boolean
.TRUE.
IntersectionMatrix
s
elements.
IntersectionMatrix
to the
dimension symbols in dimensionSymbols
.
IntersectionMatrix
to dimensionValue
.
minimumDimensionValue
if the
element is less.
IntersectionMatrix
, changes the
element to the corresponding minimum dimension symbol if the element is
less.
minimumDimensionValue
if the element is less.
PrecisionModel
of the new reduced Geometry
will be changed to be the PrecisionModel
supplied to
specify the reduction.
Coordinate
s (x,y,z) values to that of other
.
setPrecisionModel
instead
GraphComponent
s in an Iterator
Noder
to use during noding.
Geometry
.
Geometry
.
SegmentIntersector
to use with this intersector.
Envelope
a "null" envelope, that is, the envelope
of the empty geometry.
GraphComponent
s in an Iterator
null
if this Polygon
is empty.
AssertionFailedException
.
AssertionFailedException
with the given
message.
TaggedLineString
s
LineString
s
of the source geometry
to the vertices of the given snap geometry.
Geometry
,
if the vertex is closer than minDistance.
String
of repeated characters.
Geometry
not in
other
, and the points in other
not in this
Geometry
.
Geometry
s, using enhanced precision.
LineSegment
which is tagged with its location in a parent Geometry
.LineString
which can be modified to a simplified shape.TaggedLineString
s, preserving topology
(in the sense that no new intersections are introduced).Geometry
validation errorTRUE => 'T'
.
'*' => DONTCARE
.
Geometry
with the same extent as the given envelope.
List
to an array.
LineString
.
LineString
.
List
to an array.
List
to an array.
EXTERIOR => 'e'
.
List
to an array.
List
to an array.
List
to an array.
Point
.
List
to an array.
List
to an array.
String
of the form (x,y,z) .
String
representation of this IntersectionMatrix
.
Geometry
.
Geometry
touches a given geometry.
Collection
and returns the results in a new List
CoordinateSequence
.
LineString
geometry.
CoordinateFilter
that builds a set of Coordinate
s.Geometry
representing all the points in this Geometry
and other
.
Polygonal
Geometry
s.
Geometry
s, using enhanced precision.
Geometry
s, using enhanced precision.
Geometry
from a byte stream in Well-Known Binary format.Geometry
into Well-Known Binary format.Geometry
s with
output dimension = 2 and BIG_ENDIAN byte order
Geometry
s with
the given output dimension (2 or 3) and BIG_ENDIAN byte order
Geometry
s with
the given output dimension (2 or 3) and byte order
Geometry
s in WKT format
from a text file.Geometry
.GeometryFactory
.
GeometryFactory
.
Geometry
.Geometry
s with
the given output dimension (2 or 3).
Geometry
is within a given geometry.
Geometry
into a byte array.
Geometry
to an OutStream
.
Geometry
to its Well-known Text representation.
Geometry
to its Well-known Text representation.
write
, but with newlines and spaces to make the
well-known text more readable.
write
, but with newlines and spaces to make the
well-known text more readable.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |