|
JTS Topology Suite version 1.12 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
Collection of Geometrys to be sequenced.
Geometry to be sequenced.
Geometry to the edges to be polygonized.
Edge to the subgraph.
AffineTransformation defined by a set of control vectors.AffineTransformations defined by various kinds of
inputs and transformation mapping rules.Geometry's
coordinates.
Geometry's
CoordinateSequences.
Geometry and its
subelement Geometrys (if any).
Geometrys
using the area of intersection between the geometries.AssertionFailedException.
AssertionFailedException with the given detail
message.
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.Geometry, using enhanced precision.
DirectedEdges and Nodes.Geometry, MultiGeometry, or
GeometryCollection to contain the Geometrys in
it.
InStream.InStream,
with the representation being in either common byte ordering.Polygonal geometrys.Geometrys.
g's class is GeometryCollection
.
Edges
are correctly noded.
Geometry.
Geometry object
(including all coordinates contained by it).
GeometryCollection object.
LineString object.
Point object.
Polygon object.
Collections.Geometry interface hierarchy and supporting classes.Geometrys.Geometry or GeometryCollection
Geometrys.
Geometrys should be reshifted.
Geometrys.doubles, allowing for NaN values.
Coordinates along to the number of
dimensions specified.
Coordinate arrays
in the forward direction of their coordinates,
using lexicographic ordering.
doubles, allowing for NaN values.
CoordinateSequences for relative order.
compareTo encountered as
the two Collections are iterated over.
Coordinates for their relative position along a segment
lying in the specified Octant.
CoordinateSequences
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.
OrientedCoordinateArrays 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.
Coordinate
from each connected component of a Geometry.AffineTransformation.
AffineTransformation with this transformation.
Geometry
, or a null Envelope if this Geometry is empty.
SegmentStrings, i.e.
SegmentStrings.
SegmentStrings.
Geometry
( Polygon or MultiPolygon )
is connected.Subgraphs of a PlanarGraph.GeometryGraph representing an area
(a Polygon or MultiPolygon )
has consistent semantics for area geometries.GeometryGraph
are consistent.ConstraintVertexEnvelope other
lies wholely inside this Envelope (inclusive of the boundary).
Geometry contains a given geometry.
Edge
DirectedEdge
Edge is contained in this subgraph
Vertexes.
QuadEdgees.
Geometry properly contains a given geometry.
Geometry.Geometry.
Coordinate array.
Polygon that contains all the
points in the Geometry.
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).
Coordinates, 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.
Comparator for Coordinate arrays
modulo their directionality.Comparator for Coordinate arrays
in the forward direction of their coordinates,
using lexicographic ordering.CoordinateSequence implementation that Geometrys use by default.Coordinates.
CoordinateSequences represented as an array of Coordinates.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.Coordinates, which may
be set to prevent repeated coordinates from occuring in the list.Coordinates in a
CoordinateSequence to match the supplied PrecisionModel.CoordinateSequences.CoordinateSequences.CoordinateSequence.CoordinateSequencesCoordinateSequence to another CoordinateSequence.
CoordinateSequences
CoordinateSequence to another CoordinateSequence.
Coordinate array.
Coordinate array
into a destination Coordinate array.
Geometry is covered by a given geometry.
Envelope other
lies wholely inside this Envelope (inclusive of the boundary).
Geometry covers a given 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.
Coordinate.
Coordinates.
LineString.
Polygon.
CoordinateSequence
Polygon.
LinearRing using the given Coordinates.
LinearRing using the given CoordinateSequence.
MultiPoint using the given Points.
MultiPoint using the given Coordinates.
QuadEdgeTriangles for all facets of a
QuadEdgeSubdivision representing a triangulation.
PointShapeFactory.Point.
Polygon with the given exterior boundary and
interior boundaries.
Polygon.
Polygon.
Polygon
of a given positive power.
Geometry crosses a given geometry.
Geometry by inserting extra vertices along the line segments
contained in the geometry.PrecisionModel.
Geometry representing the points making up this
Geometry that do not make up other.
Geometrys, using enhanced precision.
Geometrys, using enhanced precision.
PlanarGraph.from node to the
to node.
DirectedEdges which leave a Node
in a PlanarGraph.Iterator over the DirectedEdges in this graph,
in the order in which they were added.
Geometry.Geometry is disjoint from a given geometry.
SegmentStrings in the input Collection
SegmentString.
Envelope.
Geometry
and the Geometry g
Geometry items,
using the Geometry.distance(Geometry) method.
Geometrys which lie
within a given distance, or else are the nearest points
on the geometries (in which case this also
provides the distance between the geometries).Geometry using the standard Douglas-Peucker algorithm.PlanarGraph.QuadEdgeTriangles in breadth-first orderEdgeEnds which arise from a noded Edge.EdgeEnds which obey the following invariant:
They originate at the same node and have the same direction.EdgeEndBundles around a RelateNode.Edge.Iterator over the Edges in this graph,
in the order in which they were added.
Edges is correctly noded.Edges.
LineMergeDirectedEdges forming one of the lines that will
be output by the line-merging process.Coordinates from a Geometry.
Geometry with the given edit operation.
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.
Geometry.
Envelope of a collection of Coordinates.
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.
Coordinates
are equal.
true if other has the same values for x,
y and z.
Geometrys are exactly equal,
up to a specified distance tolerance.
Geometrys 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
the given Coordinate.
Envelope so that it contains
the given point.
Envelope so that it contains
the other Envelope.
Coordinate array
from indices start to
end (inclusive).
Geometry
and adds them to the provided List.
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, offset by the given distance.
Coordinate for the point
on the line at the given index.
Coordinate for the point
on the line at the given index, offset by the given distance.
Geometry
to SegmentStrings.
Coordinates from the given Geometry.
Geometry
specified by a subsequence of a CoordinateSequence.GeometryFactory used to create this Geometry
SegmentStrings is correctly noded.SegmentStrings intersect.coord.
CoordinateSequence.
geom.
geom.
Node at the given location,
or null if no Node was there.
Font glyphs for strings
into Polygonal geometry.Location of a point relative to
the polygonal components of a geometry, using a tolerance value.GeometryFactory.
GeometryFactory.
GeometryCollection.
CoordinateFilter).
Geometrys of
arbitrary type and dimension.Geometrys in a Geometry,
(which may be either a collection or an atomic geometry).Geometry.
GeometryCollection
into another GeometryCollection via a defined
mapping function.Shape which contains a heterogeneous collection of other shapes
representing JTS Geometrys.Geometrys
to produce a GeometryCollection of the most appropriate type.Geometry classes support the concept of applying
a GeometryComponentFilter
filter to the Geometry.Geometrys
which are modifications of existing ones.Geometrys with the same GeometryFactory as the input Geometry.
Geometrys with the given GeometryFactory.
GeometryEditor.GeometryEditorOperation which modifies the coordinate list of a Geometry.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.GeometryGraphs.Geometrys,
using the Geometry.distance(Geometry) method.GeometryLocation.INSIDE_AREA if the point is not on a segment).
Geometrys
via defined mapping functions.Geometrys using Snap-Rounding
to a given PrecisionModel.Geometry
according to the supplied PrecisionModel,
ensuring that the result is topologically valid.Geometry
to another Geometry's vertices.Geometry into
an output Geometry, possibly changing its structure and type(s).Geometry.
GeometryCollection
Polygon
Geometry is empty.
Geometrys inherent boundary.
Dimension.FALSE, since by definition LinearRings do
not have a boundary.
Geometry.
MonotoneChains
for the given list of coordinates.
AbstractNodes, or if this is a leaf node, real data (wrapped
in ItemBoundables).
GraphComponent in a Iterator set
which has the specified visited state.
Segments which represent the constraints.
Geometry that represents the convex hull of the input
geometry.
Coordinate.
Geometry
(usually, but not necessarily, the first one).
Coordinate at the given position.
Coordinate along the
given linear Geometry which is
referenced by this location.
Coordinate of this location.
Geometry containing the error).
Coordinates.
Coordinates.
GeometryCollection
of Polygons, clipped as specified.
LineString which is a minimum diameter
DirectedEdge that starts from the given node, or null if the
node is not one of the two nodes associated with this Edge.
MultiLineString.
MultiLineString.
QuadEdges (one for every pair of
vertices which is connected).
MultiLineString
containing 2-point lines.
Geometry.
Geometrys 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.
KdTree which contains the vertices of the triangulation.
Geometry.
LineString
Polygon
LinearLocation
on a linear Geometry.
LineString component the iterator is current at.
Geometry
and adds them to the provided Collection.
Geometry
and adds them to the provided Collection.
Geometry
and adds them to the provided Collection.
Geometry
and adds them to the provided Collection.
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.
Envelopes maximum x-value.
Envelopes maximum y-value.
LineStrings created by the merging process.
Polygon which encloses the input geometry.
Envelopes minimum x-value.
Envelopes minimum y-value.
DirectedEdge on the right-hand (CW)
side of the given DirectedEdge
(which must be a member of this DirectedEdgeStar).
DirectedEdge on the left-hand (CCW)
side of the given DirectedEdge
(which must be a member of this DirectedEdgeStar).
Collection of fully noded SegmentStrings.
Collection of fully noded SegmentStrings.
Geometrys in a GeometryCollection
(or 1, if the geometry is not a collection).
Geometrys 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 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.
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.
Geometry.
QuadEdgeSubdivision which represents the triangulation.
QuadEdgeSubdivision which models the computed triangulation.
QuadEdgeSubdivision which models the computed diagram.
AffineTransformation
determined by the control point mappings,
or null if the control vectors do not determine a well-defined transformation.
QuadEdge.
GeometryCollection
of Polygon.
GeometryCollection
of Polygon.
GeometryCollection
of triangular Polygons.
Vertexes.
QuadEdges whose origin
vertices are a unique set which includes
all vertices in the subdivision.
Vertexes in the subdivision,
including the frame vertices if desired.
Polygons for the Voronoi cells
of this triangulation.
Coordinate forming one end of the minimum diameter
DefaultHandler which builds Geometrys
from GML2-formatted geometries.Geometry.Geometrys as XML fragments in GML2 format.Geometrys.
null elements.
Geometrys
using the Hausdorff distance metric.Coordinates.
Coordinate array
is (overall) increasing.
Vertexes, using an
incrementatal insertion algorithm.QuadEdgeSubdivision.
Geometrys
using a Branch-and-Bound algorithm.Geometry.
LinearRings are
nested inside another ring in the set, using a spatial
index to speed up the comparisons.Location of Coordinates relative to
a Polygonal geometry, using indexing for efficiency.Geometry
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.
QuadEdgeTriangles
InputStream to be used as an InStreamEnvelope to the index
CoordinateArraySequenceFactory
SegmentStrings,
if one exists.Envelopes.
Geometry representing the points shared by this
Geometry and other.
Geometrys, using enhanced precision.
Geometrys, using enhanced precision.
SegmentStrings
and adds them to each string.IntersectionMatrix with FALSE
dimension values.
IntersectionMatrix with the given dimension
symbols.
IntersectionMatrix with the same elements as
other.
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.
Geometry.
X or Y ordinate of
a Coordinate is not a valid numeric value (e.g.
Coordinates 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*.
Geometrys are equal, from the point
of view of the equalsExact method.
true if isDisjoint returns false.
true if this Envelope is a "null"
envelope.
Coordinate lies on a QuadEdge, up to a
tolerance determined by the subdivision tolerance.
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.
Coordinates forms a ring,
by checking length and closure.
CoordinateSequence forms a valid LinearRing,
by checking the sequence length and closure
(whether the first and last points are identical in 2D).
Geometry is sequenced correctly.
Geometry is simple.
true, since by definition LinearRings are always simple.
Geometry is simple.BoundaryNodeRule
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.
Geometry is valid.
isValid() method
for Geometrys.Vertex is the start or end vertex of a
QuadEdge, up to the subdivision tolerance distance.
IntersectionMatrix is
T*F**F***.
Geometry
to another is less than or equal to a specified value.
ItemBoundables in an STRtree.NodedSegmentStrings completely.EdgeIntersections
KdTree, which represents one or more points in the same location.Label indicates the topological relationship of a component
of a topology graph to a given Geometry.QuadEdges in a QuadEdgeSubdivision,
optimizing the search by starting in the
locality of the last edge found.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.Geometry subclasses which
are 1-dimensional and have components which are LineStrings.LineString) components from a Geometry.LineString or MultiLineString)
incrementally (point-by-point).LineStrings and MultiLineStrings.Geometry
LinearLocation on a linear Geometry
Geometry
LineString or MultiLineString.LinearRing.LinearRing with the vertices
specifed by the given CoordinateSequence.
DirectedEdges
created by an OverlayOp.DirectedEdge of a
LineMergeGraph.from node to the
to node.
LineMergeGraph.Coordinates.LineString.LineString with the given points.
LineString elements from a Geometry.LineString
to a set of target snap vertices.LineString
as source snap points.
Location of a point in an areal Geometry.
Location of a point in the Geometry.
Location of a point in an areal Geometry.
Location) of a single point
to a Geometry.
Location of the given Coordinate
in this geometry.
Vertex, if one exists.
Coordinate, if one exists.
Location of a point in a ring.
Geometry.Geometry
using LinearLocations as the index.Geometry.
Vertex o to Vertex d.
Geometry
(which may be atomic or composite)
into another Geometry of most specific type.
IntersectionMatrix
satisfies the required dimension symbols.
DirectedEdges which may contain nodes of degree > 2.SegmentStrings using a index based
on MonotoneChains and a SpatialIndex.SegmentStrings in a SpatialIndex containing
MonotoneChains to a given HotPixel.SegmentStrings using a index based
on MonotoneChains and a SpatialIndex.SegmentStrings.PointInRing
using MonotoneChains and a Bintree index to
increase performance.Edges with the property that no node
has degree greater than 2.Geometry.Geometry.Geometry.Geometry.
Geometry,
with a hint if
the Geometry is convex
(e.g.
MonotoneChains
for sequences of Coordinates.PrecisionModels is the most precise
(allows the greatest number of significant digits).
Points.Polygons.ItemDistance as the distance metric.
ItemDistance as the distance metric.
ItemDistance as the distance metric.
Bintree.Quadtree.PlanarGraphis a location where 0 or more Edges
meet.Bintree.Quadtree.Iterator over the Nodes in this graph.
Nodes, indexed by the coordinate of the node.SegmentStrings.SegmentStrings is correctly noded.AffineTransformation
is non-invertible.LineIntersector.Geometry to normal form (or
canonical form ).
HCoordinate has been computed which is
not representable on the Cartesian plane.Coordinate
Coordinates
Envelope
OctagonalEnvelope
(the copy constructor).
Geometry
Geometry component (ring, line or point).Geometry.Geometry.q
relative to a
vector specified by p1-p2.
Coordinate relative to this segment.
Coordinate arrays
in an orientation-independent way.OrientedCoordinateArray
for the given Coordinate array.
OutputStream to be used as an OutStreamGeometry overlaps a given geometry.