98 void addCandidatePosition( std::unique_ptr< LabelPosition > position );
134 QList<LabelPosition *> getSolution(
bool returnInactive, QList<LabelPosition *> *unlabeled =
nullptr );
139 void init_sol_falp();
149 return &mPositionsWithNoCandidates;
172 QStringList labelledLayersName;
177 int mTotalCandidates = 0;
187 std::size_t mFeatureCount = 0;
192 bool mDisplayAll =
false;
197 double mMapExtentBounds[4] = {0, 0, 0, 0};
199 std::vector< std::unique_ptr< LabelPosition > > mLabelPositions;
204 std::vector< std::unique_ptr< LabelPosition > > mPositionsWithNoCandidates;
206 std::vector< int > mFeatStartId;
207 std::vector< int > mFeatNbLp;
208 std::vector< double > mInactiveCost;
215 std::vector< int > activeLabelIds;
217 void init( std::size_t featureCount )
219 activeLabelIds.resize( featureCount, -1 );
224 double mNbOverlap = 0.0;
226 Chain *chain(
int seed );
230 void solution_cost();
A rtree spatial index for use in the pal labeling engine.
A rectangle specified with double values.
Contains information about the context of a rendering operation.
LabelPosition is a candidate feature label position.
Custom priority queue for use in pal labeling engine.
Representation of a labeling problem.
LabelPosition * featureCandidate(int feature, int candidate) const
Returns the candidate corresponding to the specified feature and candidate index.
int featureCandidateCount(int feature) const
Returns the number of candidates generated for the feature at the specified index.
std::size_t featureCount() const
Returns the total number of features considered during the labeling problem.
PalRtree< LabelPosition > & allCandidatesIndex()
Returns the index containing all label candidates.
Problem & operator=(const Problem &other)=delete
Problem cannot be copied.
Problem(const Problem &other)=delete
Problem cannot be copied.
std::vector< std::unique_ptr< LabelPosition > > * positionsWithNoCandidates()
Returns a reference to the list of label positions which correspond to features with no candidates.
Chain solution parameters.