Modifier and Type | Method and Description |
---|---|
static Coordinate |
InteriorPointArea.centre(Envelope envelope)
Returns the centre point of the envelope.
|
Constructor and Description |
---|
RectangleLineIntersector(Envelope rectEnv)
Creates a new intersector for the given query rectangle,
specified as an
Envelope . |
Modifier and Type | Method and Description |
---|---|
static double |
HausdorffSimilarityMeasure.diagonalSize(Envelope env) |
Modifier and Type | Field and Description |
---|---|
protected Envelope |
Geometry.envelope
The bounding box of this
Geometry . |
Modifier and Type | Method and Description |
---|---|
protected abstract Envelope |
Geometry.computeEnvelopeInternal()
Returns the minimum and maximum x and y values in this
Geometry
, or a null Envelope if this Geometry is empty. |
protected Envelope |
LineString.computeEnvelopeInternal() |
protected Envelope |
Polygon.computeEnvelopeInternal() |
protected Envelope |
GeometryCollection.computeEnvelopeInternal() |
protected Envelope |
Point.computeEnvelopeInternal() |
static Envelope |
CoordinateArrays.envelope(Coordinate[] coordinates)
Computes the envelope of the coordinates.
|
Envelope |
CoordinateSequence.expandEnvelope(Envelope env)
Expands the given
Envelope to include the coordinates in the sequence. |
Envelope |
Geometry.getEnvelopeInternal()
Gets an
Envelope containing
the minimum and maximum x and y values in this Geometry . |
Envelope |
Envelope.intersection(Envelope env)
Computes the intersection of two
Envelope s. |
Modifier and Type | Method and Description |
---|---|
boolean |
Envelope.contains(Envelope other)
Tests if the
Envelope other
lies wholely inside this Envelope (inclusive of the boundary). |
boolean |
Envelope.covers(Envelope other)
Tests if the
Envelope other
lies wholely inside this Envelope (inclusive of the boundary). |
double |
Envelope.distance(Envelope env)
Computes the distance between this and another
Envelope . |
Envelope |
CoordinateSequence.expandEnvelope(Envelope env)
Expands the given
Envelope to include the coordinates in the sequence. |
void |
Envelope.expandToInclude(Envelope other)
Enlarges this
Envelope so that it contains
the other Envelope. |
OctagonalEnvelope |
OctagonalEnvelope.expandToInclude(Envelope env) |
void |
Envelope.init(Envelope env)
Initialize an
Envelope from an existing Envelope. |
static Coordinate[] |
CoordinateArrays.intersection(Coordinate[] coordinates,
Envelope env)
Extracts the coordinates which intersect an
Envelope . |
Envelope |
Envelope.intersection(Envelope env)
Computes the intersection of two
Envelope s. |
boolean |
Envelope.intersects(Envelope other)
Check if the region defined by
other
overlaps (intersects) the region of this Envelope . |
boolean |
Envelope.overlaps(Envelope other)
Deprecated.
Use #intersects instead. In the future, #overlaps may be
changed to be a true overlap check; that is, whether the intersection is
two-dimensional.
|
Geometry |
GeometryFactory.toGeometry(Envelope envelope)
Creates a
Geometry with the same extent as the given envelope. |
Constructor and Description |
---|
Envelope(Envelope env)
Create an
Envelope from an existing Envelope. |
OctagonalEnvelope(Envelope env)
Creates a new null bounding octagon bounding an
Envelope |
Modifier and Type | Method and Description |
---|---|
Envelope |
CoordinateArraySequence.expandEnvelope(Envelope env) |
Envelope |
PackedCoordinateSequence.Double.expandEnvelope(Envelope env) |
Envelope |
PackedCoordinateSequence.Float.expandEnvelope(Envelope env) |
Modifier and Type | Method and Description |
---|---|
Envelope |
CoordinateArraySequence.expandEnvelope(Envelope env) |
Envelope |
PackedCoordinateSequence.Double.expandEnvelope(Envelope env) |
Envelope |
PackedCoordinateSequence.Float.expandEnvelope(Envelope env) |
Modifier and Type | Method and Description |
---|---|
Envelope |
Edge.getEnvelope() |
Modifier and Type | Method and Description |
---|---|
void |
SpatialIndex.insert(Envelope itemEnv,
Object item)
Adds a spatial item with an extent specified by the given
Envelope to the index |
List |
SpatialIndex.query(Envelope searchEnv)
Queries the index for all items whose extents intersect the given search
Envelope
Note that some kinds of indexes may also return objects which do not in fact
intersect the query envelope. |
void |
SpatialIndex.query(Envelope searchEnv,
ItemVisitor visitor)
Queries the index for all items whose extents intersect the given search
Envelope ,
and applies an ItemVisitor to them. |
boolean |
SpatialIndex.remove(Envelope itemEnv,
Object item)
Removes a single item from the tree.
|
Modifier and Type | Method and Description |
---|---|
Envelope |
MonotoneChain.getEnvelope() |
Modifier and Type | Method and Description |
---|---|
void |
MonotoneChain.select(Envelope searchEnv,
MonotoneChainSelectAction mcs)
Determine all the line segments in the chain whose envelopes overlap
the searchEnvelope, and process them.
|
Modifier and Type | Method and Description |
---|---|
List |
KdTree.query(Envelope queryEnv)
Performs a range search of the points in the index.
|
void |
KdTree.query(Envelope queryEnv,
KdNodeVisitor visitor)
Performs a range search of the points in the index and visits all nodes found.
|
void |
KdTree.query(Envelope queryEnv,
List result)
Performs a range search of the points in the index.
|
Modifier and Type | Method and Description |
---|---|
static Envelope |
Quadtree.ensureExtent(Envelope itemEnv,
double minExtent)
Ensure that the envelope for the inserted item has non-zero extents.
|
Envelope |
Node.getEnvelope() |
Envelope |
Key.getEnvelope() |
Modifier and Type | Method and Description |
---|---|
void |
NodeBase.addAllItemsFromOverlapping(Envelope searchEnv,
List resultItems) |
void |
Key.computeKey(Envelope itemEnv)
return a square envelope containing the argument envelope,
whose extent is a power of two and which is based at a power of 2
|
static int |
Key.computeQuadLevel(Envelope env) |
static Node |
Node.createExpanded(Node node,
Envelope addEnv) |
static Node |
Node.createNode(Envelope env) |
static Envelope |
Quadtree.ensureExtent(Envelope itemEnv,
double minExtent)
Ensure that the envelope for the inserted item has non-zero extents.
|
NodeBase |
Node.find(Envelope searchEnv)
Returns the smallest existing
node containing the envelope.
|
Node |
Node.getNode(Envelope searchEnv)
Returns the subquad containing the envelope searchEnv.
|
static int |
NodeBase.getSubnodeIndex(Envelope env,
double centrex,
double centrey)
Gets the index of the subquad that wholly contains the given envelope.
|
void |
Quadtree.insert(Envelope itemEnv,
Object item) |
void |
Root.insert(Envelope itemEnv,
Object item)
Insert an item into the quadtree this is the root of.
|
protected abstract boolean |
NodeBase.isSearchMatch(Envelope searchEnv) |
protected boolean |
Root.isSearchMatch(Envelope searchEnv) |
protected boolean |
Node.isSearchMatch(Envelope searchEnv) |
List |
Quadtree.query(Envelope searchEnv)
Queries the tree and returns items which may lie in the given search envelope.
|
void |
Quadtree.query(Envelope searchEnv,
ItemVisitor visitor)
Queries the tree and visits items which may lie in the given search envelope.
|
boolean |
Quadtree.remove(Envelope itemEnv,
Object item)
Removes a single item from the tree.
|
boolean |
NodeBase.remove(Envelope itemEnv,
Object item)
Removes a single item from this subtree.
|
void |
NodeBase.visit(Envelope searchEnv,
ItemVisitor visitor) |
Constructor and Description |
---|
Key(Envelope itemEnv) |
Node(Envelope env,
int level) |
Modifier and Type | Method and Description |
---|---|
void |
STRtree.insert(Envelope itemEnv,
Object item)
Inserts an item having the given bounds into the tree.
|
Object |
STRtree.nearestNeighbour(Envelope env,
Object item,
ItemDistance itemDist)
Finds the item in this tree which is nearest to the given
Object ,
using ItemDistance as the distance metric. |
List |
STRtree.query(Envelope searchEnv)
Returns items whose bounds intersect the given envelope.
|
void |
STRtree.query(Envelope searchEnv,
ItemVisitor visitor)
Returns items whose bounds intersect the given envelope.
|
boolean |
STRtree.remove(Envelope itemEnv,
Object item)
Removes a single item from the tree.
|
Modifier and Type | Method and Description |
---|---|
Envelope |
HotPixel.getSafeEnvelope()
Returns a "safe" envelope that is guaranteed to contain the hot pixel.
|
Modifier and Type | Method and Description |
---|---|
Envelope |
FacetSequence.getEnvelope() |
Modifier and Type | Method and Description |
---|---|
Envelope |
AxisPlaneCoordinateSequence.expandEnvelope(Envelope env) |
Modifier and Type | Method and Description |
---|---|
Envelope |
AxisPlaneCoordinateSequence.expandEnvelope(Envelope env) |
Modifier and Type | Field and Description |
---|---|
protected Envelope |
GeometricShapeBuilder.extent |
Modifier and Type | Method and Description |
---|---|
Envelope |
GeometricShapeBuilder.getExtent() |
Envelope |
GeometricShapeBuilder.getSquareExtent() |
Modifier and Type | Method and Description |
---|---|
void |
GeometricShapeBuilder.setExtent(Envelope extent) |
Modifier and Type | Method and Description |
---|---|
protected Coordinate |
RandomPointsBuilder.createRandomCoord(Envelope env) |
Modifier and Type | Method and Description |
---|---|
static Envelope |
DelaunayTriangulationBuilder.envelope(Collection coords)
Computes the
Envelope of a collection of Coordinate s. |
Modifier and Type | Method and Description |
---|---|
void |
VoronoiDiagramBuilder.setClipEnvelope(Envelope clipEnv)
Sets the envelope to clip the diagram to.
|
Modifier and Type | Method and Description |
---|---|
Envelope |
QuadEdgeSubdivision.getEnvelope()
Gets the envelope of the Subdivision (including the frame).
|
Constructor and Description |
---|
QuadEdgeSubdivision(Envelope env,
double tolerance)
Creates a new instance of a quad-edge subdivision based on a frame triangle
that encloses a supplied bounding box.
|
Modifier and Type | Method and Description |
---|---|
Envelope |
GeometricShapeFactory.Dimensions.getEnvelope() |
Modifier and Type | Method and Description |
---|---|
void |
GeometricShapeFactory.setEnvelope(Envelope env) |
void |
GeometricShapeFactory.Dimensions.setEnvelope(Envelope env) |
Copyright © 2016. All rights reserved.