15 #ifndef COSTCALCULATOR_H
16 #define COSTCALCULATOR_H
64 #endif // COSTCALCULATOR_H
static void setCandidateCostFromPolygon(LabelPosition *lp, RTree< PointSet *, double, 2, double > *obstacles, double bbx[4], double bby[4])
Set cost to the smallest distance between lPos's centroid and a polygon stored in geoetry field...
static void setPolygonCandidatesCost(int nblp, LabelPosition **lPos, int max_p, RTree< PointSet *, double, 2, double > *obstacles, double bbx[4], double bby[4])
static void addObstacleCostPenalty(LabelPosition *lp, PointSet *feat)
increase candidate's cost according to its collision with passed feature
void update(PointSet *pset)
For usage in problem solving algorithm.
static int finalizeCandidatesCosts(Feats *feat, int max_p, RTree< PointSet *, double, 2, double > *obstacles, double bbx[4], double bby[4])
sort candidates by costs, skip the worse ones, evaluate polygon candidates
LabelPosition is a candidate feature label position.
PolygonCostCalculator(LabelPosition *lp)
LabelPosition * getLabel()
Data structure to compute polygon's candidates costs.