A - static field in class com.vividsolutions.jts.geom.
Dimension Dimension value of a surface (2).
Constructs an AbstractNode at the given level in the tree
Base class for STRtree and SIRtree.
Constructs an AbstractSTRtree with the specified maximum number of child
nodes that a node may have
Adds a collection of Geometries to be processed.
Add a collection of geometries to be polygonized.
Add a set of edges and nodes, which form a graph.
Adds the length defined by an array of coordinates.
Adds an intersection into the list, if it isn't already there.
Adds an intersection into the list, if it isn't already there.
Adds the area defined by an array of
coordinates.
Adds the length defined by an array of coordinates.
Add an array of coordinates
Add an array of coordinates
Adds the area defined by a Geometry to the centroid total.
Adds the linestring(s) defined by a Geometry to the centroid total.
Adds the point(s) defined by a Geometry to the centroid total.
Add a geometry to the set of geometries whose common bits are
being computed.
Adds a Geometry to be processed.
Add a geometry to the linework to be polygonized.
Adds one matrix to another.
Insert an edge unless it is already in the list
Add the edge to the list of edges at this node
Adds a node for the start point of this EdgeEnd
(if one does not already exist in this map).
Adds a directed edge which is known to form part of this line.
Adds a new member to this DirectedEdgeStar.
Adds a
DirectedEdge
which is known to form part of this ring.
Adds the Edge to this PlanarGraph; only subclasses can add DirectedEdges,
to ensure the edges added are of the right class.
Adds the Edge and its DirectedEdges with this PlanarGraph.
Adds a node to the map, replacing any that is already at that location.
Adds a node to the map, replacing any that is already at that location.
Add an array of coordinates
Adds either an AbstractNode, or if this is a leaf node, a data object
(wrapped in an ItemBoundable)
Adds the common coordinate bits back into a Geometry.
Adds an Edge, DirectedEdges, and Nodes for the given LineString representation
of an edge.
Add an Edge computed externally.
Add a set of edges to the graph.
Adds entries for the first and last points of the edge to the list
Adds entries for the first and last points of the edge to the list
Adds a hole to the polygon formed by this ring.
Add an EdgeIntersection for intersection intIndex.
Add an SegmentNode for intersection intIndex.
Add an EdgeIntersection for intersection intIndex.
Adds EdgeIntersections for one or both
intersections found for a segment of an edge to the edge intersection list.
Adds EdgeIntersections for one or both
intersections found for a segment of an edge to the edge intersection list.
This method is called by clients of the EdgeIntersector class to test for and add
intersections for two segments of the edges being intersected.
This method expects that a node has a coordinate value.
Adds an outgoing DirectedEdge to this Node.
Add a point computed externally.
Finds a reasonable point at which to label a Geometry.
Adds a new node (equal to the snap pt) to the segment
if the snapPt is
within tolerance of the segment
Creates new edges for all the edges that the intersections in this
list split the parent edge into.
Creates new edges for all the edges that the intersections in this
list split the parent edge into.
Performs an operation with or on this Geometry
's
coordinates.
Performs an operation with or on this Geometry
's
coordinates.
Performs an operation with or on this Geometry and its
component Geometry's.
Performs an operation with or on this Geometry and its
component Geometry's.
Performs an operation with or on this Geometry
and its
subelement Geometry
s (if any).
Performs an operation with or on this Geometry
and its
subelement Geometry
s (if any).
The operation args into an array so they can be accessed by index
A utility for making programming assertions.
Thrown when the application is in an inconsistent state.
Creates an AssertionFailedException
.
Creates a AssertionFailedException
with the given detail
message.
Returns either the given coordinate array if its length is greater than the
given amount, or an empty coordinate array.
CAP_BUTT - static field in class com.vividsolutions.jts.operation.buffer.
BufferOp Specifies a butt (or flat) line buffer end cap style.
Specifies a round line buffer end cap style.
Specifies a square line buffer end cap style.
Returns the centre point of the envelope.
Computes the centroid of an area geometry.
Computes the centroid of a linear geometry.
Computes the centroid of a point geometry.
cga - static field in class com.vividsolutions.jts.planargraph.
DirectedEdge cga - field in class com.vividsolutions.jts.geomgraph.
EdgeRing cga - static field in class com.vividsolutions.jts.geomgraph.
PlanarGraph Specifies and implements various fundamental Computational Geometric algorithms.
Throws an exception if g
's class is GeometryCollection
.
A value that indicates an orientation of clockwise, or a right turn.
Creates a deep copy of the Object
Returns a deep copy of this collection.
Returns a deep copy of this collection.
Ensure this coordList is a ring, by adding the start point if necessary
Report the locations of the closest points in the input geometries.
Computes the closest point on this line segment to another point.
Report the coordinates of the closest points in the input geometries.
Compute the the closest points of two geometries.
Computes the closest points on two line segments.
A value that indicates an orientation of collinear, or no turn (straight).
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Contains the Geometry
interface hierarchy and supporting classes.
Provides classes that parse and modify Geometry objects.
Contains classes that implement topology graphs.
Contains classes that implement indexes for performing noding on geometry graph edges.
Provides classes for various kinds of spatial indexes.
Contains classes that implement a Binary Interval Tree index
Contains classes that implement Monotone Chains
Contains classes that implement a Quadtree spatial index
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
Contains classes which implement a sweepline algorithm for scanning geometric data structures.
Contains the interfaces for converting JTS objects to and from other formats.
Classes to compute nodings for arrangements of line segments and line segment sequences.
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
Provides classes for implementing operations on geometries
Provides classes for computing buffers of geometries
Provides classes for computing the distance between geometries
Contains classes that perform a topological overlay to compute boolean spatial functions.
Contains classes to implement the computation of the spatial relationships of Geometry
s.
Provides classes for testing the validity of geometries.
Contains classes to implement a planar graph data structure.
Provides classes for manipulating the precision model of Geometries
Contains support classes for the Java Topology Suite.
Determines the maximum number of common most-significant
bits in the mantissa of one or numbers.
Provides versions of Geometry spatial functions which use
common bit removal to reduce the likelihood of robustness problems.
Creates a new instance of class, which reshifts result
Geometry
s.
Creates a new instance of class, specifying whether
the result
Geometry
s should be reshifted.
Allow computing and removing common mantissa bits from one or more Geometries.
Returns the right-hand quadrant of the halfplane defined by the two quadrants,
or -1 if the quadrants are opposite, or the quadrant if they are identical.
Returns the first non-zero result of compareTo
encountered as
the two Collection
s are iterated over.
Implements the total order relation:
a has a greater angle with the positive x-axis than b
Using the obvious algorithm of simply computing the angle is not robust,
since the angle calculation is obviously susceptible to roundoff.
Returns 1 if this DirectedEdge has a greater angle with the
positive x-axis than b", 0 if the DirectedEdges are collinear, and -1 otherwise.
BufferSubgraphs are compared on the x-value of their rightmost Coordinate.
Compares this object with the specified object for order.
Returns 1 if this DirectedEdge has a greater angle with the
positive x-axis than b", 0 if the DirectedEdges are collinear, and -1 otherwise.
Returns whether this Geometry
is greater than, equal to,
or less than another Geometry
.
Compares this object with the specified object for order.
Compares this
PrecisionModel
object with the specified object for order.
ProjectionEvents are ordered first by their x-value, and then by their eventType.
ProjectionEvents are ordered first by their x-value, and then by their eventType.
Returns whether this Geometry
is greater than, equal to,
or less than another Geometry
having the same class.
Returns whether this Geometry
is greater than, equal to,
or less than another Geometry
having the same class.
Returns a representation of space that encloses this Boundable,
preferably not much bigger than this Boundable's boundary yet fast to
test for intersection with the bounds of other Boundables.
Computes the "edge distance" of an intersection point p along a segment.
Creates stub edges for all the intersections in this
Edge (if any) and inserts them into the graph.
Returns the minimum and maximum x and y values in this Geometry
, or a null Envelope
if this Geometry
is empty.
Returns the minimum and maximum x and y values in this Geometry
, or a null Envelope
if this Geometry
is empty.
Update the IM with the contribution for this component.
compute the contribution to an IM for this component
Basic nodes do not compute IMs
Update the IM with the contribution for this component.
Compute the intersection of a point p and the line p1-p2.
Computes the intersection of the lines p1-p2 and p3-p4.
Insert nodes for all intersections on the edges of a Geometry.
Computes all self-intersections between edges in a set of edges,
allowing client to choose whether self-intersections are computed.
Computes all self-intersections between edges in a set of edges,
allowing client to choose whether self-intersections are computed.
Computes all self-intersections between edges in a set of edges,
allowing client to choose whether self-intersections are computed.
Computes all mutual intersections between two sets of edges.
Computes all mutual intersections between two sets of edges.
Computes all mutual intersections between two sets of edges.
return a square envelope containing the argument envelope,
whose extent is a power of two and which is based at a power of 2
return a square envelope containing the argument envelope,
whose extent is a power of two and which is based at a power of 2
This computes the overall edge label for the set of
edges in this EdgeStubBundle.
Compute the labelling for all dirEdges in this star, as well
as the overall labelling
Computes the orientation of a point q to the directed line segment p1-p2.
Collect all the points from the DirectedEdges of this ring into a contiguous list
Compute a LinearRing from the point list previously collected.
Compute self-nodes, taking advantage of the Geometry type to
minimize the number of intersection tests.
A ConnectedElementPointFilter extracts a single point
from each connected element in a Geometry
(e.g.
Extracts a single point
from each connected element in a Geometry
(e.g.
Returns true
if the given point lies in or on the envelope.
Returns true
if the Envelope other
lies wholely inside this Envelope
(inclusive of the boundary).
Returns true
if other.within(this)
returns
true
.
Returns true
if the given point lies in or on the envelope.
This method will cause the ring to be computed.
Checks the current set of shells (with their associated holes) to
see if any of them contain the point.
Returns the smallest convex Polygon
that contains all the
points in the Geometry
.
Create a new convex hull construction for the input
Geometry
.
coord - field in class com.vividsolutions.jts.geomgraph.
Node A lightweight class used to store coordinates
on the 2-dimensional Cartesian plane.
Constructs a Coordinate
at (0,0,NaN).
Constructs a Coordinate
having the same (x,y,z) values as
other
.
Constructs a Coordinate
at (x,y,NaN).
Constructs a Coordinate
at (x,y,z).
Constructs a CoordinateArrayFilter
.
Useful utility functions for handling Coordinate arrays
Constructs a sequence based on the given array (the
array is not copied).
Constructs a sequence based on the given array (the
array is not copied).
Constructs a sequence of a given size, populated
with new
Coordinate
s.
Creates CoordinateSequences represented as an array of
Coordinate
s.
Geometry
classes support the concept of applying a
coordinate filter to every coordinate in the Geometry
.
A list of
Coordinate
s, which may
be set to prevent repeated coordinates from occuring in the list.
Constructs a new list without any coordinates
The basic constructor for a CoordinateArray allows repeated points
(i.e produces a CoordinateList with exactly the same set of points)
Constructs a new list from an array of Coordinates,
allowing caller to specify if repeated points are to be removed.
The internal representation of a list of coordinates inside a Geometry.
A soft reference to the Coordinate[] representation of this sequence.
Creates a deep copy of the argument
Copy all nodes from an arg geometry into this graph.
A value that indicates an orientation of counterclockwise, or a left turn.
Returns a DefaultCoordinateSequence based on the given array (the array is
not copied).
Creates the subgraph consisting of all edges reachable from this node.
Creates a elliptical arc, as a LineString.
Creates a GeometryCollection using the given Geometries; a null or empty
array will create an empty GeometryCollection.
Creates a LinearRing using the given Coordinates; a null or empty array will
create an empty LinearRing.
Creates a LinearRing using the given CoordinateSequence; a null or empty CoordinateSequence will
create an empty LinearRing.
Creates a LineString using the given Coordinates; a null or empty array will
create an empty LineString.
Creates a LineString using the given CoordinateSequence; a null or empty CoordinateSequence will
create an empty LineString.
Creates a MultiLineString using the given LineStrings; a null or empty
array will create an empty MultiLineString.
Creates a MultiPoint using the given Coordinates; a null or empty array
will create an empty MultiPoint.
Creates a MultiPoint using the given CoordinateSequence; a null or empty CoordinateSequence will
create an empty MultiPoint.
Creates a MultiPoint using the given Points; a null or empty array will
create an empty MultiPoint.
Creates a MultiPolygon using the given Polygons; a null or empty array
will create an empty Polygon.
The basic node constructor does not allow for incident edges
The basic node constructor does not allow for incident edges
Sorts the childBoundables then divides them into groups of size M, where
M is the node capacity.
Creates the parent level for the given child level.
Creates a Point using the given Coordinate; a null Coordinate will create
an empty Geometry.
Creates a Point using the given CoordinateSequence; a null or empty
CoordinateSequence will create an empty Point.
Constructs a Polygon
with the given exterior boundary and
interior boundaries.
Returns
true
if the DE-9IM intersection matrix for the two
Geometry
s is
- T*T****** (for a point and a curve, a point and an area or a line
and an area)
- 0******** (for two curves)
.
Provides routines to simplify and localize debugging output.
The default number of facets into which to divide a fillet of 90 degrees.
Creates CoordinateSequences represented as an array of
Coordinate
s.
Depth - class com.vividsolutions.jts.geomgraph.
Depth A Depth object records the topological depth of the sides
of an Edge for up to two Geometries.
depth() - method in class com.vividsolutions.jts.index.bintree.
Bintree Depth() - constructor for class com.vividsolutions.jts.geomgraph.
Depth Returns the number of levels in the tree.
depth() - method in class com.vividsolutions.jts.index.strtree.
STRtree Returns the number of items in the tree.
Computes the factor for the change in depth when moving from one location to another.
deStar - field in class com.vividsolutions.jts.planargraph.
Node The collection of DirectedEdges that leave this Node
Returns a Geometry
representing the points making up this
Geometry
that do not make up other
.
Computes the set-theoretic difference of two
Geometry
s, using enhanced precision.
Computes the set-theoretic difference of two
Geometry
s, using enhanced precision.
Constants representing the dimensions of a point, a curve and a surface.
The dimensions of the coordinates hold in the packed array
Constructs a DirectedEdge connecting the from
node to the
to
node.
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node.
Constructs a DirectedEdgeStar with no edges.
dirEdge - field in class com.vividsolutions.jts.planargraph.
Edge The two DirectedEdges associated with this Edge
Returns an Iterator over the DirectedEdges in this PlanarGraph, in the order in which they
were added.
Returns true
if the DE-9IM intersection matrix for the two
Geometry
s is FF*FF****.
Report the distance between the closest points on the input geometries.
"Fixes" this Coordinate to the PrecisionModel grid.
Computes the distance between this line segment and a point.
Computes the distance between this and another
Envelope
.
Returns the minimum distance between this Geometry
and the Geometry
g
Compute the distance between the closest points of two geometries.
Computes the distance between this line segment and another one.
Computes the distance from a line segment AB to a line segment CD
Note: NON-ROBUST!
Computes the distance and
closest points between two
Geometry
s.
Constructs a DistanceOp that computes the distance and closest points between
the two specified geometries.
Computes the perpendicular distance between the (infinite) line defined
by this line segment and a point.
Computes the distance from a point p to a line segment AB
Note: NON-ROBUST!
Computes the perpendicular distance from a point p
to the (infinite) line containing the points AB
Dimension value for any dimension (= {FALSE, TRUE}).
Packed coordinate sequence implementation based on doubles
Builds a new packed coordinate sequence out of a coordinate array
Builds a new packed coordinate sequence out of a coordinate array
Builds a new packed coordinate sequence
Builds a new packed coordinate sequence out of a float coordinate array
Builds a new empty packed coordinate sequence of a given size and dimension
DoubleBits manipulates Double numbers
by using bit manipulation and bit-field extraction.
Simplifies a linestring (sequence of points) using
the standard Douglas-Peucker algorithm.
Simplifies a
Geometry
using the standard Douglas-Peucker algorithm.
Edge - class com.vividsolutions.jts.geomgraph.
Edge Edge - class com.vividsolutions.jts.planargraph.
Edge edge - field in class com.vividsolutions.jts.geomgraph.
EdgeEnd Edge() - constructor for class com.vividsolutions.jts.planargraph.
Edge Constructs an Edge whose DirectedEdges are not yet set.
Constructs an Edge initialized with the given DirectedEdges, and for each
DirectedEdge: sets the Edge, sets the symmetric DirectedEdge, and adds
this Edge to its from-Node.
Models the end of an edge incident on a node.
Contains all
EdgeEnd
s which start at the same point and are parallel.
A EdgeEndStar is an ordered list of EdgeEnds around a node.
An EdgeIntersection represents a point on an
edge which intersects with another edge.
A list of edge intersections along an Edge
Returns an Iterator over the Edges in this PlanarGraph, in the order in which they
were added.
A EdgeList is a list of Edges.
A list of all outgoing edges in the result, in CCW order
A map which maintains the edges in sorted order around the node
Validates that a collection of SegmentStrings is correctly noded.
edges - field in class com.vividsolutions.jts.geomgraph.
Node An EdgeSetIntersector computes all the intersections between the
edges in the set.
A sequence of
LineMergeDirectedEdge
s forming one of the lines that will
be output by the line-merging process.
Constructs an EdgeString with the given factory used to convert this EdgeString
to a LineString
Edits a Geometry by returning a new Geometry with a modification.
Edits a Geometry by returning a new Geometry with a modification.
Edit the input
Geometry
with the given edit operation.
Provides versions of Geometry spatial functions which use
enhanced precision techniques to reduce the likelihood of robustness problems.
Ensure that the envelope for the inserted item has non-zero extents.
Ensure that the Interval for the inserted item has non-zero extents.
Defines a rectangular region of the 2D coordinate plane.
The bounding box of this Geometry
.
Creates an Envelope
for a region defined by a single Coordinate.
Creates an Envelope
for a region defined by two Coordinates.
Create an Envelope
from an existing Envelope.
Creates an Envelope
for a region defined by maximum and minimum values.
Returns true if the two arrays are identical, both null, or pointwise
equal (as compared using Coordinate#equals)
Returns true
if the DE-9IM intersection matrix for the two
Geometry
s is T*F**FFF*.
Returns true
if other
has the same values for
the x and y ordinates.
equals is defined to be:
e1 equals e2
iff
the coordinates of e1 are the same or the reverse of the coordinates in e2
Returns true
if other
has the same values for
its points.
Throws an AssertionFailedException
if the given objects are
not equal, according to the equals
method.
Throws an AssertionFailedException
with the given message if
the given objects are not equal, according to the equals
method.
Returns whether the planar projections of the two Coordinate
s
are equal.
Returns true
if other
has the same values for x,
y and z.
Returns true if the two Geometry
s are exactly equal.
Returns true if the two Geometry
s are exactly equal,
up to a specified tolerance.
Returns true if the two Geometry
s are exactly equal,
up to a specified tolerance.
Returns true if the two Geometry
s are exactly equal,
up to a specified tolerance.
Returns true
if other
is
topologically equal to this LineSegment (e.g.
Expands the given
Envelope
to include the coordinates in the sequence.
Expands the given
Envelope
to include the coordinates in the sequence.
Expands the given
Envelope
to include the coordinates in the sequence.
Expands the given
Envelope
to include the coordinates in the sequence.
Enlarges the boundary of the Envelope
so that it contains
(x,y).
Enlarges the boundary of the Envelope
so that it contains
other
.
Enlarges the boundary of the Envelope
so that it contains
(x,y).
DE-9IM row index of the exterior of the first geometry and column index of
the exterior of the second geometry.
Computes various kinds of common geometric shapes.
Create a shape factory which will create shapes using the default
GeometryFactory
.
Create a shape factory which will create shapes using the given
GeometryFactory
.
Internal representation of this GeometryCollection
.
Basic implementation of Geometry
.
Notifies this Geometry that its Coordinates have been changed by an external
party (using a CoordinateFilter, for example).
Notifies this Geometry that its Coordinates have been changed by an external
party.
Basic implementation of GeometryCollection
.
Constructs an iterator over the given GeometryCollection
.
Geometry
classes support the concept of applying
a GeometryComponentFilter
filter to the Geometry
.
Supports creating a new
Geometry
which is a modification of an existing one.
Creates a new GeometryEditor object which will create
an edited
Geometry
with the same
GeometryFactory
as the input Geometry.
Creates a new GeometryEditor object which will create
the edited Geometry with the given
GeometryFactory
A interface which specifies an edit operation for Geometries.
Supplies a set of utility methods for building Geometry objects from lists
of Coordinates.
Constructs a GeometryFactory that generates Geometries having a floating
PrecisionModel and a spatial-reference ID of 0.
Constructs a GeometryFactory that generates Geometries having the given
CoordinateSequence implementation, a double-precision floating PrecisionModel and a
spatial-reference ID of 0.
Constructs a GeometryFactory that generates Geometries having the given
PrecisionModel
and the default CoordinateSequence
implementation.
Constructs a GeometryFactory that generates Geometries having the given
PrecisionModel
and spatial-reference ID, and the default CoordinateSequence
implementation.
Constructs a GeometryFactory that generates Geometries having the given
PrecisionModel, spatial-reference ID, and CoordinateSequence implementation.
GeometryCollection
classes support the concept of
applying a GeometryFilter
to the Geometry
.
A GeometryGraph is a graph that models a given Geometry
The base class for operations that require
Represents the location of a point on a Geometry.
Constructs a GeometryLocation specifying a point inside an area geometry.
Constructs a GeometryLocation specifying a point on a geometry, as well as the
segment that the point is on (or INSIDE_AREA if the point is not on a segment).
A framework for processes which transform an input
Geometry
into
an output
Geometry
, possibly changing its structure and type(s).
Returns the value of one of this IntersectionMatrix
s
elements.
Returns the angle that the start of this DirectedEdge makes with the
positive x-axis, in radians.
Returns the area of this Geometry
.
Returns the area of this GeometryCollection
Returns the area of this Polygon
Extracts the i'th bit of a bitstring.
Returns the boundary, or the empty geometry if this Geometry
is empty.
Returns the boundary, or the empty geometry if this Geometry
is empty.
Returns the boundary, or the empty geometry if this Geometry
is empty.
Returns the dimension of this Geometry
s inherent boundary.
Returns the dimension of this Geometry
s inherent boundary.
Returns the dimension of this Geometry
s inherent boundary.
Returns a representation of space that encloses this Boundable, preferably
not much bigger than this Boundable's boundary yet fast to test for intersection
with the bounds of other Boundables.
Returns a representation of space that encloses this Boundable, preferably
not much bigger than this Boundable's boundary yet fast to test for intersection
with the bounds of other Boundables.
Returns a representation of space that encloses this Boundable, preferably
not much bigger than this Boundable's boundary yet fast to test for intersection
with the bounds of other Boundables.
getCentre() - method in class com.vividsolutions.jts.index.quadtree.
Key Computes the centroid of this Geometry
.
Return a list of the
MonotoneChain
s
for the given list of coordinates.
Return an array containing lists of start/end indexes of the monotone chains
for the given list of coordinates.
Returns either child AbstractNodes, or if this is a leaf node, real data (wrapped
in ItemBoundables).
The common bits of the Coordinates in the supplied Geometries.
Returns a
Geometry
that represents the convex hull of the input
geometry.
Returns the coordinate of the from-node.
Returns the coordinate for the node at wich this star is based
Returns a vertex of this Geometry
.
Returns a vertex of this Geometry
.
Returns the location of this Node.
Get the Coordinate with index i.
Returns (possibly a copy of) the i'th coordinate in this sequence.
Returns the Coordinate
at the given position.
Copies the i'th coordinate in the sequence to the supplied
Coordinate
.
Get a copy of the Coordinate with index i.
Returns a copy of the i'th coordinate in this sequence.
Returns a Coordinate representation of the specified coordinate, by always
building a new Coordinate object
Returns the gathered Coordinate
s.
Returns this Geometry
s vertices.
Collects all coordinates of all subgeometries into an Array.
Return the subsequence of coordinates forming this chain.
Returns the gathered Coordinate
s.
Returns a list containing a Coordinate from each Polygon, LineString, and Point
found inside the specified geometry.
Returns the result of the filtering.
Computes the set of raw offset curves for the buffer.
Get the list of cut edges found during polygonization.
Get the list of dangling lines found during polygonization.
Returns the number of edges around the Node associated with this DirectedEdgeStar.
Returns the number of edges around this Node.
The depthDelta is the change in depth as an edge is crossed from R to L
Returns the dimension of this Geometry
.
Returns the dimension of this Geometry
.
Returns the dimension of this Geometry
.
Returns a point to which an imaginary line is drawn from the from-node to
specify this DirectedEdge's orientation.
Returns the
DirectedEdge
that starts from the given node, or null if the
node is not one of the two nodes associated with this Edge.
Returns one of the DirectedEdges associated with this Edge.
Returns this DirectedEdge's parent Edge, or null if it has none.
Returns whether the direction of the parent Edge (if any) is the same as that
of this Directed Edge.
Computes the "edge distance" of an intersection point along the specified input line segment.
Returns the DirectedEdges, in ascending order by angle with the positive x-axis.
Returns the list of DirectedEdges that make up this EdgeRing
Returns the Edges that have been added to this PlanarGraph
Returns all Edges that connect the two nodes (which are assumed to be different).
Returns this Geometry
s bounding box.
Returns the minimum and maximum x and y values in this Geometry
, or a null Envelope
if this Geometry
is empty.
Determines the exponent for the number
Gets the factory which contains the context in which this geometry was created.
Returns the node from which this DirectedEdge leaves.
Returns the geometry associated with this location.
Returns the name of this object's com.vivid.jts.geom
interface.
Returns the name of this object's com.vivid.jts.geom
interface.
Returns the name of this object's com.vivid.jts.geom
interface.
Returns the difference between the maximum and minimum y values.
Returns the zero-based index of the given DirectedEdge, after sorting in ascending order
by angle with the positive x-axis.
Returns the zero-based index of the given Edge, after sorting in ascending order
by angle with the positive x-axis.
Returns the zero-based index of the given Edge, after sorting in ascending order
by angle with the positive x-axis.
Returns the remainder when i is divided by the number of edges in this
DirectedEdgeStar.
Computes the index of the intIndex'th intersection point in the direction of
a specified input line segment
Computes an interior point of this Geometry
.
Returns the intIndex'th intersection point
Computes the intIndex'th intersection point in the direction of
a specified input line segment
Returns the number of intersection points found.
Get the list of lines forming invalid rings found during polygonization.
Returns the identifier attached to this directed edge.
Returns the length of this Geometry
.
Returns the length of this Geometry
.
Computes the length of the line segment.
Returns the length of this LineString
Gets the length of the minimum diameter of the input Geometry
Returns the perimeter of this Polygon
Returns 0 if this node is a leaf, 1 if a parent of a leaf, and so on; the
root node will have the highest level
getLevel() - method in class com.vividsolutions.jts.index.bintree.
Key getLevel() - method in class com.vividsolutions.jts.index.quadtree.
Key Returns the LineString specifying the vertices of this edge.
This method handles single points as well as lines.
Extracts the linear components from a single geometry.
Gets the coordinates for this ring as a
LineString
.
Returns a list containing a point from each Polygon, LineString, and Point
found inside the specified geometry.
Returns the maximum number of significant digits provided by this
precision model.
Returns the Envelope
s maximum x-value.
Returns the Envelope
s maximum y-value.
Returns the LineStrings built by the merging process.
Returns the Envelope
s minimum x-value.
Returns the Envelope
s minimum y-value.
Returns the directed edge that starts at this directed edge's end point, or null
if there are zero or multiple directed edges starting there.
Returns the next directed edge in the EdgeRing that this directed edge is a member
of.
Returns the DirectedEdge on the left-hand side of the given DirectedEdge (which
must be a member of this DirectedEdgeStar).
Returns the subquad containing the envelope.
Returns the subnode containing the envelope.
Returns the maximum number of child nodes that a node may have
Returns the Nodes in this PlanarGraph.
Returns the count of this Geometry
s vertices.
Returns the count of this Geometry
s vertices.
Returns the x-offset used to obtain a precise coordinate.
Returns the y-offset used to obtain a precise coordinate.
If node
is one of the two nodes associated with this Edge,
returns the other node; otherwise returns null.
Returns the ordinate of a coordinate in this sequence.
Returns the collection of DirectedEdges that leave this Node.
getPoint() - method in class com.vividsolutions.jts.index.bintree.
Key getPoint() - method in class com.vividsolutions.jts.index.quadtree.
Key Returns the Point components from a single geometry.
Gets the list of polygons formed by the polygonization.
Returns the Polygon components from a single geometry.
Returns the PrecisionModel
used by the Geometry
.
Returns the PrecisionModel that Geometries created by this factory
will be associated with.
Returns 0, 1, 2, or 3, indicating the quadrant in which this DirectedEdge's
orientation lies.
Returns the buffer computed for a geometry for a given buffer distance.
Comutes the buffer for a geometry for a given buffer distance
and accuracy of approximation.
Gets the rightmost coordinate in the edges of the subgraph
Returns this ring as a
LinearRing
, or null if an Exception occurs while
creating it (such as a topology problem).
This method handles the degenerate cases of single points and lines,
as well as rings.
Returns the multiplying factor used to obtain a precise coordinate.
Returns the segment index for this location.
Returns the ID of the Spatial Reference System used by the Geometry
.
Returns the index of the subquad that wholly contains the given envelope.
Returns the index of the subnode that wholely contains the given interval.
Gets the segment forming the base of the minimum diameter
Each Edge gives rise to a pair of symmetric DirectedEdges, in opposite
directions.
Returns the symmetric DirectedEdge -- the other DirectedEdge associated with
this DirectedEdge's parent Edge.
Returns the node to which this DirectedEdge goes.
Returns the type of packed coordinate sequences this factory builds, either
PackedCoordinateSequenceFactory or
PackedCoordinateSequenceFactory
Gets the type of this PrecisionModel
Gets the user data object for this geometry, if any.
Returns the difference between the maximum and minimum x values.
Gets the
Coordinate
forming one end of the minimum diameter
getX() - method in class com.vividsolutions.jts.geom.
Point Returns ordinate X (0) of the specified coordinate.
getY() - method in class com.vividsolutions.jts.geom.
Point Returns ordinate Y (1) of the specified coordinate.
A GraphComponent is the parent class for the objects'
that form a graph.
The base class for all graph component classes.
The inCentre of a triangle is the point which is equidistant
from the sides of the triangle.
Returns the index of coordinate
in coordinates
.
A visitor for nodes and items in an index.
Initialize to a null Envelope
.
Initialize an Envelope
to a region defined by a single Coordinate.
Initialize an Envelope
to a region defined by two Coordinates.
Initialize an Envelope
from an existing Envelope.
Initialize an Envelope
for a region defined by maximum and minimum values.
Adds a spatial item with an extent specified by the given
Envelope
to the index
Insert an item into the quadtree this is the root of.
Adds a spatial item with an extent specified by the given
Envelope
to the index
Inserts an item having the given bounds into the tree.
Insert a directed edge in the list
Insert a EdgeEnd in order in the list.
Insert a EdgeEnd into this EdgeEndStar
Insert an item into the tree this is the root of.
Inserts an item having the given bounds into the tree.
Inserted edges are checked to see if an identical edge already exists.
Insert an EdgeEnd into the map, and clear the edgeList cache,
since the list of edges has now changed
Insert an edge from one of the noded input graphs.
Special value of segment-index for locations inside area geometries.
Returns the singleton instance of DefaultCoordinateSequenceFactory
DE-9IM row index of the interior of the first geometry and column index of
the interior of the second geometry.
Computes a point in the interior of an area geometry.
Computes a point in the interior of an linear geometry.
Computes a point in the interior of an point geometry.
The spatial functions supported by this class.
Computes the (approximate) intersection point between two line segments
using homogeneous coordinates.
Returns a Geometry
representing the points shared by this
Geometry
and other
.
Computes the set-theoretic intersection of two
Geometry
s, using enhanced precision.
Computes the set-theoretic intersection of two
Geometry
s, using enhanced precision.
Computes an intersection point between two segments, if there is one.
A Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix.
Creates an IntersectionMatrix
with FALSE
dimension values.
Creates an IntersectionMatrix
with the same elements as
other
.
Creates an IntersectionMatrix
with the given dimension
symbols.
Check if the point p
overlaps (lies inside) the region of this Envelope
.
Test the point q to see whether it intersects the Envelope defined by p1-p2
Test the envelope defined by p1-p2 for intersection
with the envelope defined by q1-q2
Convenience method to test a point for intersection with
a Geometry
Check if the region defined by other
overlaps (intersects) the region of this Envelope
.
Returns true
if disjoint
returns false.
Check if the point (x, y)
overlaps (lies inside) the region of this Envelope
.
For STRtrees, the bounds will be Envelopes; for SIRtrees, Intervals;
for other subclasses of AbstractSTRtree, some other class.
A test for intersection between two bounds, necessary because subclasses
of AbstractSTRtree have different implementations of bounds.
Represents an (1-dimensional) closed interval on the Real number line.
A contiguous portion of 1D-space.
Provides a test for whether an interval is
so small it should be considered as zero for the purposes of
inserting it into a binary tree.
The indexes of the endpoints of the intersection lines, in order along
the corresponding line
isArea() - method in class com.vividsolutions.jts.geomgraph.
Label Computes whether a ring defined by an array of
Coordinate
is
oriented counter-clockwise.
Computes whether a ring defined by an array of
Coordinate
is
oriented counter-clockwise.
An Edge is collapsed if it is an Area edge and it consists of
two segments which are equal and opposite (eg a zero-width V).
Returns true
if this IntersectionMatrix
is
T*****FF*.
Returns true if the given point is a vertex of this LineString
.
This method is used to decide if an L edge should be included in the result or not.
This method is used to decide if a point node should be included in the result or not.
Returns
true
if this
IntersectionMatrix
is
- T*T****** (for a point and a curve, a point and an area or a line
and an area)
- 0******** (for two curves)
.
Returns true
if this IntersectionMatrix
is
FF*FF****.
Returns whether or not the set of points in this Geometry
is
empty.
Returns whether or not the set of points in this Geometry
is
empty.
Returns true
if this IntersectionMatrix
is
T*F**FFF*.
Returns whether the two Geometry
s are equal, from the point
of view of the equalsExact
method.
Tests whether the precision model supports floating point
Tests whether this ring is a hole.
Tests whether the segment is horizontal.
This method implements the Boundary Determination Rule
for determining whether
a component (node or edge) that appears multiple times in elements
of a MultiGeometry is in the boundary or the interior of the Geometry
The SFS uses the "Mod-2 Rule", which this function implements
An alternative (and possibly more intuitive) rule would be
the "At Most One Rule":
isInBoundary = (componentCount == 1)
Returns whether the given quadrant lies within the given halfplane (specified
by its right-hand quadrant).
Tests whether a given point is in an array of points.
Returns the ring of directed edges that this directed edge is
a member of, or null if the ring has not been set.
Returns whether this GeometryLocation represents a point inside an area geometry.
This is an interior Area edge if
- its label is an Area label for both Geometries
- and for each Geometry both sides are in the interior.
Tests whether either intersection point is an interior point of one of the input segments.
Tests whether either intersection point is an interior point of the specified input segment.
This routine searches the list for the insertion point for the given intersection
(which must be in normalized form).
Test whether a point is a intersection point of two line segments.
Returns true
if isDisjoint
returns false.
An isolated component is one that does not intersect or touch any other
component.
An isolated component is one that does not intersect or touch any other
component.
This edge is a line edge if
- at least one of the labels is a line label
- any labels which are not line labels have all Locations = EXTERIOR
Tests if a component has been marked at some point during the processing
involving this graph.
Returns true if the given quadrant is 0 or 1.
isNull() - method in class com.vividsolutions.jts.geomgraph.
Depth A Depth object is null (has never been initialized) if all depths are null.
Returns true
if this Envelope
is a "null"
envelope.
Test whether a point lies on the line segments defined by a
list of coordinates.
Returns true if the quadrants are 1 and 3, or 2 and 4
Returns
true
if this
IntersectionMatrix
is
- T*T***T** (for two points or two surfaces)
- 1*T***T** (for two curves)
.
Test whether a point lies inside a ring.
Computes whether a ring defined by an array of
Coordinate
is
oriented counter-clockwise.
Tests whether an intersection is proper.
This method will handle arguments of Location.NULL correctly
The root node matches all searches
Returns false if the Geometry
not simple.
Returns false if the Geometry
not simple.
Returns false if the Geometry
not simple.
A MultiPoint is simple iff it has no repeated points
Returns true
if this IntersectionMatrix
is
FT*******, F**T***** or F***T****.
Throws an AssertionFailedException
if the given assertion is
not true.
Throws an AssertionFailedException
with the given message if
the given assertion is not true.
Tests if the
LinearRing
ring formed by this edge ring is topologically valid.
Tests the validity of this Geometry
.
Checks whether a coordinate is valid for processing.
Implements the algorithsm required to compute the
isValid()
method
for
Geometry
s.
Tests whether the segment is vertical.
Tests if a component has been visited during the course of a graph algorithm
Returns true
if this IntersectionMatrix
is
T*F**F***.
Tests whether the distance from this Geometry
to another is less than or equal to a specified value.
Computes whether the interval [min, max] is effectively zero width.
Boundable wrapper for a non-Boundable spatial object.
items - field in class com.vividsolutions.jts.index.bintree.
NodeBase items - field in class com.vividsolutions.jts.index.quadtree.
NodeBase A visitor for items in an index.
Nodes a set of SegmentStrings completely.
Returns an Iterator over the DirectedEdges, in ascending order by angle with the positive x-axis.
Iterator access to the ordered list of edges is optimized by
copying the map collection to a list.
returns an iterator of EdgeIntersections
Returns an Iterator over the Nodes in this NodeMap, sorted in ascending order
by angle with the positive x-axis.
Adds an intersection into the list, if it isn't already there.
P - static field in class com.vividsolutions.jts.geom.
Dimension Dimension value of a point (0).
p0 - field in class com.vividsolutions.jts.geom.
Triangle p1 - field in class com.vividsolutions.jts.geom.
Triangle p2 - field in class com.vividsolutions.jts.geom.
Triangle Builds packed array coordinate sequences.
Creates a new PackedCoordinateSequenceFactory
of type DOUBLE.
Creates a new PackedCoordinateSequenceFactory
of the given type.
Creates a new PackedCoordinateSequenceFactory
of the given type.
Thrown by a WKTReader
when a parsing problem occurs.
Creates a ParseException
with e
s detail message.
Creates a ParseException
with the given detail message.
The computation of the IntersectionMatrix
relies on the use of a structure
called a "topology graph".
Represents a directed graph which is embeddable in a planar surface.
Constructs a PlanarGraph without any Edges, DirectedEdges, or Nodes.
Basic implementation of Point
.
Constructs a Point
with the given coordinate.
Constructs
Point
s from the nodes of an overlay graph.
Extracts all the 0-dimensional (
Point
) components from a
Geometry
.
Constructs a PointExtracterFilter with a list in which to store Points found.
An interface for classes which test whether a
Coordinate
lies inside
a ring.
Computes the topological relationship (
Location
)
of a single point to a Geometry.
Represents a linear polygon, which may include holes.
Constructs a Polygon
with the given exterior boundary and
interior boundaries.
Constructs a Polygon
with the given exterior boundary and
interior boundaries.
Constructs a Polygon
with the given exterior boundary.
Constructs a PolygonExtracterFilter with a list in which to store Polygons found.
A
DirectedEdge
of a
PolygonizeGraph
, which represents
an edge of a polygon formed by the graph.
Constructs a directed edge connecting the from
node to the
to
node.
Polygonizes a set of Geometrys which contain linework that
represents the edges of a planar graph.
A Position indicates the position of a Location relative to a graph component
(Node, Edge, or Area).
If makePrecise is true, computed intersection coordinates will be made precise
using Coordinate#makePrecise
Creates a PrecisionModel
with a default precision
of FLOATING.
Copy constructor to create a new PrecisionModel
from an existing one.
Creates a PrecisionModel
that specifies
an explicit precision model type.
Creates a PrecisionModel
that specifies Fixed precision.
Creates a PrecisionModel
that specifies Fixed precision.
Prints a detailed string representation of this DirectedEdge to the given PrintStream.
This method is called by clients
of the
SegmentIntersector
class to process
intersections for two segments of the
SegmentStrings
being intersected.
Compute the projection of a point onto the line determined
by this line segment.
Project a line segment onto this line segment and return the resulting
line segment.
Compute the projection factor for the projection of the point p
onto this LineSegment.
pt - field in class com.vividsolutions.jts.planargraph.
Node The location of this Node
Finds a point in a list of points which is not contained in another list of points
Shifts the positions of the coordinates until firstCoordinate
is first.
segInt - field in class com.vividsolutions.jts.noding.
Noder Tests if any line segments in two sets of CoordinateSequences intersect.
Computes the intersections between two line segments in
SegmentString
s
and adds them to each string.
Contains a list of consecutive line segments which can be used to node the segments.
Determine all the line segments in the chain whose envelopes overlap
the searchEnvelope, and process them
This is a convenience function which can be overridden to obtain the actual
line segment which is selected
This function can be overridden if the original chain is needed
Changes the value of one of this IntersectionMatrix
s
elements.
Changes the elements of this IntersectionMatrix
to the
dimension symbols in dimensionSymbols
.
Changes the elements of this IntersectionMatrix
to dimensionValue
.
Changes the specified element to minimumDimensionValue
if the
element is less.
For each element in this IntersectionMatrix
, changes the
element to the corresponding minimum dimension symbol if the element is
less.
If row >= 0 and column >= 0, changes the specified element to minimumDimensionValue
if the element is less.
Sets the location of the shape by specifying the base coordinate
(which in most cases is the
lower left point of the envelope containing the shape).
Sets the location of the shape by specifying the centre of
the shape's bounding box
Sets this Coordinate
s (x,y,z) values to that of other
.
Initializes this Edge's two DirectedEdges, and for each DirectedEdge: sets the
Edge, sets the symmetric DirectedEdge, and adds this Edge to its from-Node.
Sets the distance tolerance for the simplification.
Sets the distance tolerance for the simplification.
Sets the distance tolerance for the simplification.
Sets the distance tolerance for the simplification.
Sets the distance tolerance for the simplification.
Associates this DirectedEdge with an Edge (possibly null, indicating no associated
Edge).
Specifies the end cap style of the generated buffer.
Sets the height of the shape.
Attaches an identifier to this directed edge.
Updates the label of a node to BOUNDARY,
obeying the mod-2 boundaryDetermination rule.
Force computed intersection to be rounded to a given precision model
Sets the marked flag for this component.
Sets the next directed edge in the EdgeRing that this directed edge is a member
of.
Sets the total number of points in the created Geometry
Sets the value for a given ordinate of a coordinate in this sequence.
Sets the ordinate of a coordinate in this sequence.
Force computed intersection to be rounded to a given precision model.
Sets the number of segments used to approximate a angle fillet
Specifies the end cap style of the generated buffer.
Sets whether the reduction will result in collapsed components
being removed completely, or simply being collapsed to an (invalid)
Geometry of the same type.
Sets the ring of directed edges that this directed edge is
a member of.
Sets the size of the extent of the shape in both x and y directions.
Sets the ID of the Spatial Reference System used by the Geometry
.
Sets this DirectedEdge's symmetric DirectedEdge, which runs in the opposite
direction.
Makes this Envelope
a "null" envelope, that is, the envelope
of the empty geometry.
Sets the type of packed coordinate sequences this factory builds,
acceptable values are PackedCoordinateSequenceFactoryor
PackedCoordinateSequenceFactory
A simple scheme for applications to add their own custom data to a Geometry.
Sets the visited flag for this component.
setVisitedEdge marks both DirectedEdges attached to a given Edge.
Sets the width of the shape.
Sets the precision model to use during the curve computation and noding,
if it is different to the precision model of the Geometry.
Sets the first ordinate of a coordinate in this sequence.
Sets the second ordinate of a coordinate in this sequence.
The exterior boundary,
or null
if this Polygon
is empty.
A visitor to
Geometry
elements which can
be short-circuited by a given condition
Always throws an AssertionFailedException
.
Always throws an AssertionFailedException
with the given
message.
Returns the signed area for a ring.
Computes the bit pattern for the sign and exponent of a
double-precision number.
Finds all intersections in one or two sets of edges,
using the straightforward method of
comparing all segments.
Reduces the precision of a
Geometry
according to the supplied
PrecisionModel
, without
attempting to preserve valid topology.
Finds all intersections in one or two sets of edges,
using an x-axis sweepline algorithm in conjunction with Monotone Chains.
A SimpleMCSweepLineIntersector creates monotone chains from the edges
and compares them using a simple sweep-line along the x-axis.
Tests whether any of a set of
LinearRing
s are
nested inside another ring in the set, using a simple O(n^2)
comparison.
Nodes a set of
SegmentString
s by
performing a brute-force comparison of every segment to every other one.
Computes whether a point
lies in the interior of an area
Geometry
.
Tests whether a
Coordinate
lies inside
a ring, using a linear-time algorithm.
Finds all intersections in one or two sets of edges,
using a simple x-axis sweepline algorithm.
One-dimensional version of an STR-packed R-tree.
Constructs an SIRtree with the default node capacity.
Constructs an SIRtree with the given maximum number of child nodes that
a node may have
size() - method in class com.vividsolutions.jts.index.bintree.
Bintree Returns the size of the coordinate sequence
Returns the number of coordinates in this sequence.
size() - method in class com.vividsolutions.jts.index.quadtree.
Quadtree Returns the number of items in the tree.
size() - method in class com.vividsolutions.jts.index.strtree.
STRtree Returns the number of items in the tree.
Uses snap rounding to compute a rounded, noded arrangement from a
set of linestrings.
The basic insertion and query operations supported by classes
implementing spatial index algorithms.
The ID of the Spatial Reference System used by this Geometry
Implements a timer function which can compute
elapsed time as well as split times.
Returns a String
of repeated characters.
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm.
Constructs an STRtree with the default node capacity.
Constructs an STRtree with the given maximum number of child nodes that
a node may have
Locates a subgraph inside a set of subgraphs,
in order to determine the outside depth of the subgraph.
subnodes are numbered as follows:
0 | 1
subquads are numbered as follows:
2 | 3
--+--
0 | 1
A sweepline implements a sorted index on a set of intervals.
Tests whether any of a set of
LinearRing
s are
nested inside another ring in the set, using a
SweepLineIndex
index to speed up the comparisons.
Returns a set combining the points in this Geometry
not in
other
, and the points in other
not in this
Geometry
.
Computes the set-theoretic symmetric difference of two geometries,
using enhanced precision.
Computes the set-theoretic symmetric difference of two
Geometry
s, using enhanced precision.
Simplifies a collection of TaggedLineStrings, preserving topology
(in the sense that no new intersections are introduced).
Simplifies a TaggedLineString, preserving topology
(in the sense that no new intersections are introduced).
This method exposes the internal Array of Coordinate Objects
Returns the Coordinates in this collection.
Returns (possibly copies of) the Coordinates in this collection.
Converts the given List of Coordinates into a Coordinate array.
An alternative to Stack.toArray, which is not present in earlier versions
of Java.
Converts the dimension value to a dimension symbol, for example, TRUE => 'T'
.
Converts the dimension symbol to a dimension value, for example, '*' => DONTCARE
.
Returns a List containing the parent Edge (possibly null) for each of the given
DirectedEdges.
Returns the external representation of internal
.
Sets external
to the external representation of internal
.
If the Envelope
is a null Envelope
, returns an
empty Point
.
Converts the List
to an array.
Returns the precise representation of external
.
Sets internal
to the precise representation of external
.
Converts one GeometryLocation to a Line location
Converts the List
to an array.
Converts this EdgeString into a LineString.
Converts the List
to an array.
Converts the location value to a location symbol, for example, EXTERIOR => 'e'
.
Converts the List
to an array.
Converts the List
to an array.
Converts the List
to an array.
Converts the List
to an array.
Indicates an invalid or inconsistent topological situation encountered during processing
A TopologyLocation is the labelling of a
GraphComponent's topological relationship to a single Geometry.
Constructs a TopologyLocation specifying how points on, to the left of, and to the
right of some GraphComponent relate to some Geometry.
Simplifies a geometry, ensuring that
the result is a valid geometry having the
same dimension and number of components as the input.
Contains information about the nature and location of a Geometry
validation error
Converts the List
to an array.
Returns a String
of the form (x,y,z) .
Returns the string Representation of the coordinate array
A representation of the Double bits formatted for easy readability
Returns a nine-character String
representation of this IntersectionMatrix
.
A representation of the Double bits formatted for easy readability
Returns the Well-known Text representation of this Geometry
.
Returns true
if the DE-9IM intersection matrix for the two
Geometry
s is FT*******, F**T***** or F***T****.
Transposes this IntersectionMatrix.
Represents a planar triangle, and provides methods for calculating various
properties of triangles.
TRUE - static field in class com.vividsolutions.jts.geom.
Dimension Dimension value of non-empty geometries (= {P, L, A}).