37 #include <QLinkedList> 73 PointSet(
int nbPoints,
double *
x,
double *
y );
76 PointSet* extractShape(
int nbPtSh,
int imin,
int imax,
int fps,
int fpe,
double fptx,
double fpty );
83 bool containsPoint(
double x,
double y )
const;
93 bool containsLabelCandidate(
double x,
double y,
double width,
double height,
double alpha = 0 )
const;
101 double xrm,
double yrm );
111 double minDistanceToPoint(
double px,
double py,
double *rx =
nullptr,
double *ry =
nullptr )
const;
113 void getCentroid(
double &px,
double &py,
bool forceInside =
false )
const;
137 void getPointByDistance(
double *d,
double *ad,
double dl,
double *px,
double *py );
141 const GEOSGeometry* geos()
const;
168 void createGeosGeom()
const;
169 const GEOSPreparedGeometry* preparedGeom()
const;
170 void invalidateGeos();
179 mutable const GEOSPreparedGeometry* mPreparedGeom;
PointSet * getHoleOf()
Returns NULL if this isn't a hole.
A set of features which influence the labelling process.
struct pal::_cHullBox CHullBox
double ANALYSIS_EXPORT max(double x, double y)
Returns the maximum of two doubles or the first argument if both are equal.
Main class to handle feature.
void getBoundingBox(double min[2], double max[2]) const
LabelPosition is a candidate feature label position.
double ANALYSIS_EXPORT min(double x, double y)
Returns the minimum of two doubles or the first argument if both are equal.
Data structure to compute polygon's candidates costs.