36 #include "qgis_core.h" 153 QList<LabelPosition *> getSolution(
bool returnInactive );
160 SubPart *subPart(
int r,
int featseed,
int *isIn );
162 void initialization();
164 double compute_feature_cost(
SubPart *part,
int feat_id,
int label_id,
int *nbOverlap );
165 double compute_subsolution_cost(
SubPart *part,
int *
s,
int *nbOverlap );
170 double popmusic_chain(
SubPart *part );
172 double popmusic_tabu(
SubPart *part );
179 double popmusic_tabu_chain(
SubPart *part );
184 void init_sol_empty();
185 void init_sol_falp();
194 int nbLabelledLayers = 0;
199 QStringList labelledLayersName;
220 bool displayAll =
false;
227 double *labelPositionCost =
nullptr;
228 int *nbOlap =
nullptr;
230 QList< LabelPosition * > mLabelPositions;
232 RTree<LabelPosition *, double, 2, double> *candidates =
nullptr;
233 RTree<LabelPosition *, double, 2, double> *candidates_sol =
nullptr;
234 RTree<LabelPosition *, double, 2, double> *candidates_subsol =
nullptr;
237 int *featStartId =
nullptr;
238 int *featNbLp =
nullptr;
239 double *inactiveCost =
nullptr;
244 double nbOverlap = 0.0;
246 int *featWrap =
nullptr;
250 Chain *chain(
int seed );
254 void solution_cost();
255 void check_solution();
void addCandidatePosition(LabelPosition *position)
Adds a candidate label position to the problem.
int getFeatureCandidateCount(int i)
int probSize
of features in problem
void seed(uint32_t value)
struct pal::_subpart SubPart
int subSize
total # features (prob + border)
Summary statistics of labeling problem.
LabelPosition is a candidate feature label position.
Representation of a labeling problem.
LabelPosition * getFeatureCandidate(int fi, int ci)
int borderSize
of features bounding the problem
int seed
first feat in sub part