48 m_maxAllowedDistance =
mad;
49 m_toleranceDistance =
td;
92 os <<
"(" <<
rect.m_x <<
"," <<
rect.m_y <<
":" <<
rect.m_width <<
"," <<
rect.m_height
106 m_distance = distance;
Declaration and implementation of Array class and Array algorithms.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
The parameterized class Array implements dynamic arrays of type E.
Doubly linked lists (maintaining the length of the list).
Finds in a given set of rectangles for each point in a given set of points the nearest rectangle.
double m_maxAllowedDistance
void findSimple(const Array< RectRegion > ®ion, const Array< DPoint > &point, Array< List< PairRectDist > > &nearest)
double m_toleranceDistance
void maxAllowedDistance(double mad)
double maxAllowedDistance() const
NearestRectangleFinder(double mad=20, double td=5)
double toleranceDistance() const
void find(const Array< RectRegion > ®ion, const Array< DPoint > &point, Array< List< PairRectDist > > &nearest)
void toleranceDistance(double td)
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
Represents a rectangle (given by its index) and a distance value.
friend std::ostream & operator<<(std::ostream &os, const PairRectDist &p)
PairRectDist(int index, double distance)
Represents a rectangle given by center point, width and height.
friend std::ostream & operator<<(std::ostream &os, const RectRegion &rect)