|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
PreparedPolygon relative to all other Geometry classes.Collection of Geometrys to be sequenced.
Geometry to be sequenced.
DirectedEdge which is known to form part of this ring.
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.
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.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.
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.
PreparedPolygon
and a Geometry.
Edge
DirectedEdge
Edge is contained in this subgraph
Vertexes.
QuadEdgees.
Geometry properly contains a given geometry.
PreparedPolygon
and a 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.
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.
LineString.
Polygon.
CoordinateSequence
MultiPoint using the given Coordinates.
Polygon with the given exterior boundary and
interior boundaries.
Polygon.
Polygon.
Polygon
of a given positive power.
Geometry crosses a given 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
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.
PolygonizeDirectedEdges which form
a ring of a polygon.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.
EnhancedPrecisionOp to avoid robustness problemsEnvelope.
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.
ExtendedCoordinate in this example).ExtendedCoordinates.
ExtendedCoordinates.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.
GeometryFactory used to create this Geometry
SegmentStrings is correctly noded.SegmentStringss 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).
GeometryCollection.Geometrys in a GeometryCollection.GeometryCollection.
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.INSIDE_AREA if the point is not on a segment).
Geometrys using Snap RoundingGeometry 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.
LineString.
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.
Polygon which encloses the input geometry.
Envelopes minimum x-value.
Envelopes minimum y-value.
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 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).
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.
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.
PreparedLineString
and a Geometry.
Geometry.
PreparedPolygon
and a 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.
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.
LinearRing ring formed by this edge ring is topologically 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.
EdgeIntersections
KdTree, which represents one or more points in the same location.GMLHandler class
to read geometry data out of KML files.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.LineSegments.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.
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,
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).
MultiLineString.Points.MultiPolygon.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.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.
PlanarGraphs constructed during
overlay operations.Geometrys.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 in com.vividsolutions.jts.geom.impl
- 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.
- parentEdge -
Variable in class com.vividsolutions.jts.planargraph.DirectedEdge
-
- parentGraph -
Variable in class com.vividsolutions.jts.planargraph.Subgraph
-
- ParseException - Exception in com.vividsolutions.jts.io
- Thrown by a
WKTReader when a parsing problem occurs. - ParseException(String) -
Constructor for exception com.vividsolutions.jts.io.ParseException
- Creates a
ParseException with the given detail message.
- ParseException(Exception) -
Constructor for exception com.vividsolutions.jts.io.ParseException
- Creates a
ParseException with es detail message.
- PATCH -
Static variable in class com.vividsolutions.jts.JTSVersion
- The patch version number.
- 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.
- PI_OVER_2 -
Static variable in class com.vividsolutions.jts.algorithm.Angle
-
- PI_OVER_4 -
Static variable in class com.vividsolutions.jts.algorithm.Angle
-
- PI_TIMES_2 -
Static variable in class com.vividsolutions.jts.algorithm.Angle
-
- PlanarGraph - Class in com.vividsolutions.jts.geomgraph
- 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 in com.vividsolutions.jts.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 in com.vividsolutions.jts.geom
- 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
-
- POINT_INTERSECTION -
Static variable in class com.vividsolutions.jts.algorithm.LineIntersector
- Indicates that line segments intersect in a single point
- 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).
- PointBuilder - Class in com.vividsolutions.jts.operation.overlay
- Constructs
Points from the nodes of an overlay graph. - PointBuilder(OverlayOp, GeometryFactory, PointLocator) -
Constructor for class com.vividsolutions.jts.operation.overlay.PointBuilder
-
- PointExtracter - Class in com.vividsolutions.jts.geom.util
- 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.
- PointGeometryUnion - Class in com.vividsolutions.jts.operation.union
- Computes the union of a
Puntal geometry with
another arbitrary Geometry. - PointGeometryUnion(Puntal, Geometry) -
Constructor for class com.vividsolutions.jts.operation.union.PointGeometryUnion
-
- PointInRing - Interface in com.vividsolutions.jts.algorithm
- An interface for classes which test whether a
Coordinate lies inside
a ring. - PointLocator - Class in com.vividsolutions.jts.algorithm
- Computes the topological (
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 in com.vividsolutions.jts.algorithm.locate
- An interface for classes which determine the
Location of
points in a Geometry. - PointPairDistance - Class in com.vividsolutions.jts.algorithm.distance
- Contains a pair of points and the distance between them.
- PointPairDistance() -
Constructor for class com.vividsolutions.jts.algorithm.distance.PointPairDistance
-
- PointPairDistance - Class in com.vividsolutions.jts.operation.buffer.validate
- Contains a pair of points and the distance between them.
- PointPairDistance() -
Constructor for class com.vividsolutions.jts.operation.buffer.validate.PointPairDistance
-
- points -
Variable in class com.vividsolutions.jts.geom.LineString
- The points of this
LineString.
- PointShapeFactory - Interface in com.vividsolutions.jts.awt
- An interface for classes which create
Shapes to represent point geometries. - PointTransformation - Interface in com.vividsolutions.jts.awt
- Transforms a geometry
Coordinate into a Java2D Point,
possibly with a mathematical transformation of the ordinate values. - poll() -
Method in class com.vividsolutions.jts.util.PriorityQueue
- Remove the smallest item from the priority queue.
- Polygon - Class in com.vividsolutions.jts.geom
- 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.
- Polygonal - Interface in com.vividsolutions.jts.geom
- Identifies
Geometry subclasses which
are 2-dimensional
and have components which have Lineal boundaries. - PolygonBuilder - Class in com.vividsolutions.jts.operation.overlay
- Forms
Polygons out of a graph of DirectedEdges. - PolygonBuilder(GeometryFactory) -
Constructor for class com.vividsolutions.jts.operation.overlay.PolygonBuilder
-
- PolygonExtracter - Class in com.vividsolutions.jts.geom.util
- 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.
- PolygonizeDirectedEdge - Class in com.vividsolutions.jts.operation.polygonize
- 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.
- PolygonizeExample - Class in com.vividsolutions.jtsexample.operation.polygonize
- Example of using Polygonizer class to polygonize a set of fully noded linestrings
- PolygonizeExample() -
Constructor for class com.vividsolutions.jtsexample.operation.polygonize.PolygonizeExample
-
- Polygonizer - Class in com.vividsolutions.jts.operation.polygonize
- 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 Geometrys
- PolygonShape - Class in com.vividsolutions.jts.awt
- A Shape which represents a polygon which may contain holes.
- PolygonShape(Coordinate[], Collection) -
Constructor for class com.vividsolutions.jts.awt.PolygonShape
- Creates a new polygon shape.
- PolygonUnionUsingBuffer - Class in com.vividsolutions.jtsexample.technique
- Shows a technique for using a zero-width buffer to compute
the union of a collection of polygonal geometrys.
- PolygonUnionUsingBuffer() -
Constructor for class com.vividsolutions.jtsexample.technique.PolygonUnionUsingBuffer
-
- polyList -
Variable in class com.vividsolutions.jts.operation.polygonize.Polygonizer
-
- Position - Class in com.vividsolutions.jts.geomgraph
- 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
-
- 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
- PrecisionModel - Class in com.vividsolutions.jts.geom
- Specifies the precision model of the
Coordinates 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 in com.vividsolutions.jts.geom
- The types of Precision Model which JTS supports.
- PrecisionModel.Type(String) -
Constructor for class com.vividsolutions.jts.geom.PrecisionModel.Type
-
- PrecisionModelExample - Class in com.vividsolutions.jtsexample.geom
- An example showing the results of using different precision models
in computations involving geometric constructions.
- PrecisionModelExample() -
Constructor for class com.vividsolutions.jtsexample.geom.PrecisionModelExample
-
- precModel -
Variable in class com.vividsolutions.jts.util.GeometricShapeFactory
-
- prepare(Geometry) -
Static method in class com.vividsolutions.jts.geom.prep.PreparedGeometryFactory
- Creates a new
PreparedGeometry appropriate for the argument Geometry.
- PreparedGeometry - Interface in com.vividsolutions.jts.geom.prep
- An interface for classes which prepare
Geometrys
in order to optimize the performance
of repeated calls to specific geometric operations. - PreparedGeometryExample - Class in com.vividsolutions.jtsexample.geom.prep
- Shows use of
PreparedGeometry in a batch (repeated) operation. - PreparedGeometryExample() -
Constructor for class com.vividsolutions.jtsexample.geom.prep.PreparedGeometryExample
-
- PreparedGeometryFactory - Class in com.vividsolutions.jts.geom.prep
- A factory for creating
PreparedGeometrys. - PreparedGeometryFactory() -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedGeometryFactory
-
- PreparedLineString - Class in com.vividsolutions.jts.geom.prep
- A prepared version for
Lineal geometries. - PreparedLineString(Lineal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedLineString
-
- PreparedLineStringIntersects - Class in com.vividsolutions.jts.geom.prep
- 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 in com.vividsolutions.jts.geom.prep
- A prepared version for
Puntal geometries. - PreparedPoint(Puntal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPoint
-
- PreparedPolygon - Class in com.vividsolutions.jts.geom.prep
- A prepared version for
Polygonal geometries. - PreparedPolygon(Polygonal) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygon
-
- PreparedPolygonContains - Class in com.vividsolutions.jts.geom.prep
- 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 in com.vividsolutions.jts.geom.prep
- Computes the containsProperly spatial relationship predicate
for
PreparedPolygons 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 in com.vividsolutions.jts.geom.prep
- 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 in com.vividsolutions.jts.geom.prep
- Computes the intersects spatial relationship predicate
for
PreparedPolygons relative to all other Geometry classes. - PreparedPolygonIntersects(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonIntersects
- Creates an instance of this operation.
- PreparedPolygonPredicate - Class in com.vividsolutions.jts.geom.prep
- A base class for predicate operations on
PreparedPolygons. - PreparedPolygonPredicate(PreparedPolygon) -
Constructor for class com.vividsolutions.jts.geom.prep.PreparedPolygonPredicate
- Creates an instance of this operation.
- prepLine -
Variable in class com.vividsolutions.jts.geom.prep.PreparedLineStringIntersects
-
- prepPoly -
Variable in class com.vividsolutions.jts.geom.prep.PreparedPolygonPredicate
-
- 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
-
- println(Object) -
Static method in class com.vividsolutions.jts.util.Debug
-
- println() -
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
-
- PriorityQueue - Class in com.vividsolutions.jts.util
- A priority queue over a set of
Comparable objects. - PriorityQueue() -
Constructor for class com.vividsolutions.jts.util.PriorityQueue
- Creates a new empty priority queue
- 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
SegmentStrings.
- process(Collection) -
Method in class com.vividsolutions.jts.noding.SimpleSegmentSetMutualIntersector
-
- 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.
- projectedSplitPoint(Segment, Coordinate) -
Static method in class com.vividsolutions.jts.triangulate.NonEncroachingSplitPointFinder
- Computes a split point which is the projection of the encroaching point on the segment
- 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
- Puntal - Interface in com.vividsolutions.jts.geom
- Identifies
Geometry subclasses which
are 0-dimensional and with components which are 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
-
QuadEdgeSubdivision
which either contains a given Vertex V
or is an edge of a triangle which contains V.QuadEdges representing a planar
subdivision that models a triangulation.Quadedges in a Subdivision.QuadEdges.LinearRings 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
using a standard flatness factor.
Font to a Geometry
using a standard flatness factor.
Font to a Geometry
Geometry.
Geometry.
Geometry
If a collection of geometries is found, a GeometryCollection is returned.
Reader into a single Geometry
If a collection of Geometries is found, a GeometryCollection is returned.
buf.length bytes from the input stream
and stores them in the supplied buffer.
Geometry in WKB format from a byte array.
Geometry in binary WKB format from an {@link InStream).
Geometry
from a String.
Geometry
from a Reader.
Geometry is a rectangle.Geometry is a rectangle.IntersectionMatrix for the two Geometrys match the elements in intersectionPattern.
IntersectionMatrix for the two Geometrys.
IntersectionMatrix for the spatial relationship
between two Geometrys, using the default (OGC SFS) Boundary Node Rule
IntersectionMatrix for the spatial relationship
between two Geometrys using a specified Boundary Node Rule.
NodeMap in a RelateNodeGraph to create RelateNodes.Geometrys.DirectedEdge incident on this node.
Edge and its associated DirectedEdges
from their from-Nodes and from the graph.
DirectedEdge from its from-Node and from this graph.
GeometryCollection with
every component reversed.
LineString whose coordinates are in the reverse
order of this objects
MultiLineString in the reverse
order to this object.
MultiPolygon with
every component reversed.
Bintree.Noder and transforms its input
into the integer domain.firstCoordinate
is first.
SegmentStrings,
if one exists.CoordinateSequences intersect.Noder.SegmentStrings.SegmentNodes present along a noded SegmentString.SegmentStrings to produce
a set of merged linework with unique segments.SegmentStrings
which are merged during the dissolve process.SegmentStrings.CollectionUtil.Function on each item in a Collection
and collects all the entries for which the result
of the function is equal to Boolean true.
IntersectionMatrixs
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.
Coordinates (x,y,z) values to that of other.
QuadEdgeLocator to use for locating containing triangles
in this subdivision.
setPrecisionModel instead
GraphComponents in an Iterator
Noder to use during noding.
Geometry.
SegmentIntersector to use with this intersector.
Coordinates.
Coordinates.
ConstraintSplitPointFinder to be
used during constraint enforcement.
Geometry.
Envelope a "null" envelope, that is, the envelope
of the empty geometry.
ConstraintVertexFactory to be used
to allow vertices carrying extra information to be created.
GraphComponents in an Iterator
PathIterator which provides paths for a collection of Shapes.Shapes.
Shape
or the more general PathIterator into a Geometry.Geometrys into Java2D Shape objectsnull if this Polygon
is empty.
Geometry elements which can
be short-circuited by a given conditionAssertionFailedException.
AssertionFailedException with the given
message.
Geometrys.SimilarityMeasure values.Geometry
according to the supplied PrecisionModel, without
attempting to preserve valid topology.LinearRings are
nested inside another ring in the set, using a simple O(n^2)
comparison.SegmentStrings by
performing a brute-force comparison of every segment to every other one.Polygonal Geometry,
using a simple O(n) algorithm.Coordinate lies inside
a ring, using a linear-time algorithm.SegmentStrings using
brute-force comparasion.SegmentStrings.TaggedLineStrings
GeometryFactory.
GeometryFactory.
Noders which make a single
pass to find intersections.LineStrings
of the source geometry
to the vertices of the given snap geometry.
Geometry,
if the vertex is closer than minDistance.
Geometry
String of repeated characters.
PlanarGraph.PlanarGraph
LinearRings are
nested inside another ring in the set, using a SweepLineIndex
index to speed up the comparisons.SweepLineIndex detects that two
SweepLineIntervals overlapGeometry not in
other, and the points in other not in this
Geometry.
Geometrys, using enhanced precision.
LineSegment which is tagged with its location in a parent Geometry.TaggedLineStrings, preserving topology
(in the sense that no new intersections are introduced).LineString which can be modified to a simplified shape.PathIterator into
a list of Coordinate arrays.
TRUE => 'T'
.
'*' => DONTCARE
.
Geometry with the same extent as the given envelope.
List to an array.
List to an array.
LineSegment representing the
geometry of this edge.
LineString.
LineString.
List to an array.
EXTERIOR => 'e'
.
List to an array.
List to an array.
List to an array.
Point.
List to an array.
Geometry
validation errorList to an array.
Shape representing a Geometry,
according to the specified PointTransformation
and PointShapeFactory (if relevant).
String of the form (x,y,z) .
String representation of this IntersectionMatrix
.
Geometry.
Geometry touches a given geometry.
Coordinates in a collection to Vertexes.
Coordinate into a Java2D Point.
Collection
and returns the results in a new List
CoordinateSequence.
LineString geometry.
QuadEdgeSubdivisionQuadEdgeSubdivision.Geometry representing all the points in this Geometry
and other.
Polygonal Geometrys.
Geometrys, using enhanced precision.
Geometrys, using enhanced precision.
CoordinateFilter that builds a set of Coordinates.QuadEdgeSubdivision.Coordinates of a
set of Geometrys,
and the parent geometry, and transfers the source geometry
data objects to geometry components tagged with the coordinates.QuadEdgeSubdivision.
QuadEdges of a triangle.
Geometry is within a given geometry.
Geometryfrom a byte stream in Well-Known Binary format.Geometry into Well-Known Binary format.Geometrys with
output dimension = 2 and BIG_ENDIAN byte order
Geometrys with
the given dimension (2 or 3) for output coordinates
and BIG_ENDIAN byte order.
Geometrys with
the given dimension (2 or 3) for output coordinates
and byte order
If the input geometry has a small coordinate dimension,
coordinates will be padded with NULL_ORDINATE.
Geometrys in WKT format
from a text file.Reader to read from.
Geometry.GeometryFactory.
GeometryFactory.
Geometry.Geometrys with
the given output dimension (2 or 3).
Geometry in GML2 format to a String.
Geometry in GML2 format into a Writer.
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 | |||||||||