21#include <geos/index/strtree/Boundable.h>
22#include <geos/index/strtree/ItemDistance.h>
51 struct BoundablePairQueueCompare {
53 operator()(
const BoundablePair* a,
const BoundablePair* b)
59 typedef std::priority_queue<BoundablePair*, std::vector<BoundablePair*>, BoundablePairQueueCompare> BoundablePairQueue;
111 static bool isComposite(
const Boundable* item);
115 void expandToQueue(BoundablePairQueue&,
double minDistance);
116 void expand(
const Boundable* bndComposite,
const Boundable* bndOther,
bool isFlipped, BoundablePairQueue& priQ,
double distance() const
Computes the distance between the Boundables in this pair. The boundables are either composites or le...
double maximumDistance()
Computes the maximum distance between any two items in the pair of nodes.
const Boundable * getBoundable(int i) const
double getDistance() const
Gets the minimum possible distance between the Boundables in this pair.
A spatial object in an AbstractSTRtree.
Definition Boundable.h:24
A function method which computes the distance between two ItemBoundables in an STRtree....
Definition ItemDistance.h:33
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
Definition AbstractNode.h:31
Provides classes for various kinds of spatial indexes.
Definition DiscreteFrechetDistance.h:50
Basic namespace for all GEOS functionalities.
Definition geos.h:39