|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
AffineTransformation defined by three control points
and their images under the transformation.AssertionFailedException.
AssertionFailedException with the given detail
message.
Collection of Geometrys 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
CoordinateSequences.
Geometry and its
subelement Geometrys (if any).
BinTree (or "Binary Interval Tree")
is a 1-dimensional version of a quadtree.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.DirectedEdges and Nodes.InStream.InStream,
with the representation being in either common byte ordering.Geometry, using enhanced precision.
Geometry, MultiGeometry, or
GeometryCollection to contain the Geometrys in
it.
Geometrys.
Geometrys should be reshifted.
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.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).
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.
CoordinateSequence implementation that Geometrys use by default.Coordinates.
CoordinateSequences represented as an array of Coordinates.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.Coordinates, which may
be set to prevent repeated coordinates from occuring in the list.CoordinateSequences.CoordinateSequences.CoordinateSequence.CoordinateSequencesg's class is GeometryCollection
.
Geometry.
Geometry object
(including all coordinates contained by it).
GeometryCollection object.
LineString object.
Point object.
Polygon object.
Geometry interface hierarchy and supporting classes.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.
AffineTransformation
with this transformation.
AffineTransformation.
Geometry
, or a null Envelope if this Geometry is empty.
SegmentStrings, i.e.
SegmentStrings.
SegmentStrings.
true if the given point lies in or on the envelope.
true if the given point lies in or on the envelope.
true if the Envelope other
lies wholely inside this Envelope (inclusive of the boundary).
true if this geometry contains the
specified geometry.
Edge
DirectedEdge
Edge is contained in this subgraph
Polygon that contains all the
points in the Geometry.
CoordinateSequences
true if this geometry is covered by the
specified geometry.
true if this geometry covers the
specified 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).
Polygon.
CoordinateSequence
MultiPoint using the given Coordinates.
Polygon with the given exterior boundary and
interior boundaries.
Polygon.
true if this geometry crosses the
specified geometry.
PlanarGraph.from node to the
to node.
DirectedEdges which leave a Node
in a PlanarGraph.Geometrys 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.
Geometrys, using enhanced precision.
Geometrys, using enhanced precision.
Iterator over the DirectedEdges in this graph,
in the order in which they were added.
true if this geometry is disjoint to the specified geometry.
SegmentStrings in the input Collection
SegmentString.
Envelope.
Geometry
and the Geometry g
PlanarGraph.EdgeEnds 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.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.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 Edges in this graph,
in the order in which they were added.
Coordinates 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 this geometry is equal to the
specified geometry.
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
(x,y).
Envelope so that it contains
(x,y).
Envelope so that it contains
other.
Coordinate array
from indices start to
end (inclusive).
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.
SegmentStrings is correctly noded.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.Geometrys in a GeometryCollection.GeometryCollection.
Geometry classes support the concept of applying
a GeometryComponentFilter
filter to the Geometry.Geometry which is a modification of an existing one.Geometry with the same GeometryFactory as the input Geometry.
GeometryFactory
GeometryEditorOperation which modifies the coordinate list of 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.GeometryGraphs.Geometry to another Geometry's vertices.Geometry into
an output Geometry, possibly changing its structure and type(s).GeometryCollection.
IntersectionMatrixs
elements.
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.
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.
Coordinates.
Coordinates.
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.
Geometrys bounding box.
Geometry
, or a null Envelope if this Geometry is empty.
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.
LinearLocation for a
given length along a linear Geometry.
LinearLocation corresponding to a length.
Envelopes maximum x-value.
Envelopes maximum y-value.
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.
Polygon formed by this ring and any contained holes.
PrecisionModel used by the Geometry.
LinearRing, or null if an Exception occurs while
creating it (such as a topology problem).
Geometry.
Coordinate of the current segment.
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
Geometrys.
null elements.
X or Y ordinate of
a Coordinate is not a valid numeric value (e.g.
InputStream to be used as an InStreamSegmentStrings,
if one exists.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.
Geometry is simple.BoundaryNodeRule
isValid() method
for Geometrys.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.
Geometrys, using enhanced precision.
Geometrys, 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.
true if this geometry intersects the specified geometry.
Coordinate is
oriented counter-clockwise.
Coordinate is
oriented counter-clockwise.
true if this 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 geometry crosses the
specified geometry.
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.
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.
true if this IntersectionMatrix is
T*F**F***.
Geometry
to another is less than or equal to a specified value.
EdgeIntersections
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.DirectedEdges
created by an OverlayOp.DirectedEdge of a
LineMergeGraph.from node to the
to node.
LineMergeGraph.Coordinates.LineSegments.LineString.LineString
as target snap points.
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.
Geometry
using LinearLocations as the index.Geometry.
Location) of a single point
to a Geometry.
SegmentStrings using a index based
on MonotoneChains and a SpatialIndex.SegmentStrings in a SpatialIndex containing
MonotoneChains to a given HotPixel.SegmentStrings.PointInRing
using MonotoneChains and a BinTree index to
increase performance.DirectedEdges which may contain nodes of degree > 2.Edges with the property that no node
has degree greater than 2.Geometry.Geometry.
Geometry,
with a hint if
the Geometry is convex
(e.g.
MultiLineString.Points.MultiPolygon.IntersectionMatrix
satisfies the required dimension symbols.
PrecisionModels is the most precise
(allows the greatest number of significant digits).
Bintree.Quadtree.PlanarGraphis a location where 0 or more Edges
meet.Bintree.Quadtree.Nodes, indexed by the coordinate of the node.SegmentStrings.SegmentStrings is correctly noded.SegmentStrings.
AffineTransformation
is non-invertible.HCoordinate has been computed which is
not representable on the Cartesian plane.Iterator over the Nodes in this graph.
Geometry to normal form (or
canonical form ).
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 OutStreamPlanarGraphs constructed during
overlay operations.Geometrys.q
relative to a
vector specified by p1-p2.
true if this geometry overlaps the
specified 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 es 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
Points 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.
- 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
-
- 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
Polygons out of a graph of DirectedEdges. - PolygonBuilder(GeometryFactory, CGAlgorithms) -
Constructor for class com.vividsolutions.jts.operation.overlay.PolygonBuilder
-
- PolygonExtracter - class com.vividsolutions.jts.geom.util.PolygonExtracter.
- Extracts all the 2-dimensional (
Polygon) components 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 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 Geometrys
- 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
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.
- p0 -
Variable in class com.vividsolutions.jts.geom.LineSegment
-
- p0 -
Variable in class com.vividsolutions.jts.geom.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
-
- p1 -
Variable in class com.vividsolutions.jts.planargraph.DirectedEdge
-
- p2 -
Variable in class com.vividsolutions.jts.geom.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.
- 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
- 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
-
- 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 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
-
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 is a rectangle.Geometry is a rectangle.NodeMap in a RelateNodeGraph to create RelateNodes.Geometrys.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.
true if the elements in the DE-9IM
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.
Edge and its associated DirectedEdges
from their from-Nodes and from the graph.
LineString whose coordinates are in the reverse
order of this objects
MultiLineString in the reverse
order to this object.
PointInRing
using a SIRtree index to
increase performance.Geometry
Noder and transforms its input
into the integer domain.SegmentStrings
and adds them to each string.SegmentStrings.SegmentNodes present along a noded SegmentString.SegmentStrings to produce
a set of merged linework with unique segments.Geometry elements which can
be short-circuited by a given conditionGeometry
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.Geometry.Coordinate lies inside
a ring, using a linear-time algorithm.SegmentStrings.Noders which make a single
pass to find intersections.PlanarGraph.PlanarGraph
SweepLineIndex detects that two
SweepLineIntervals overlapLinearRings are
nested inside another ring in the set, using a SweepLineIndex
index to speed up the comparisons.firstCoordinate
is first.
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
.
setPrecisionModel instead
GraphComponents in an Iterator
Noder to use during noding.
Geometry.
Geometry.
Envelope a "null" envelope, that is, the envelope
of the empty geometry.
GraphComponents in an Iterator
null if this Polygon
is empty.
AssertionFailedException.
AssertionFailedException with the given
message.
TaggedLineStrings
LineStrings
of the source geometry
to the vertices of the given geometry.
Geometry,
if the vertex is closer than maxDistance.
String of repeated characters.
Geometry 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).Geometry
validation errorTRUE => 'T'
.
'*' => DONTCARE
.
Envelope is a null Envelope, returns an
empty Point.
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.
true if this geometry touches the
specified geometry.
Collection
and returns the results in a new List
CoordinateSequence.
LineString geometry.
CoordinateFilter that builds a set of Coordinates.Geometry representing all the points in this Geometry
and other.
Geometrys, using enhanced precision.
Geometrys, using enhanced precision.
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 output dimension (2 or 3) and BIG_ENDIAN byte order
Geometrys with
the given output dimension (2 or 3) and byte order
Geometry.GeometryFactory.
GeometryFactory.
Geometry.Geometrys with
the given output dimension (2 or 3).
true if this geometry is within the
specified 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 | |||||||||