99 void addCandidatePosition( std::unique_ptr< LabelPosition > position );
135 QList<LabelPosition *> getSolution(
bool returnInactive, QList<LabelPosition *> *unlabeled =
nullptr );
140 void init_sol_falp();
150 return &mPositionsWithNoCandidates;
173 QStringList labelledLayersName;
178 int mTotalCandidates = 0;
188 std::size_t mFeatureCount = 0;
193 bool mDisplayAll =
false;
198 double mMapExtentBounds[4] = {0, 0, 0, 0};
200 std::vector< std::unique_ptr< LabelPosition > > mLabelPositions;
205 std::vector< std::unique_ptr< LabelPosition > > mPositionsWithNoCandidates;
207 std::vector< int > mFeatStartId;
208 std::vector< int > mFeatNbLp;
209 std::vector< double > mInactiveCost;
216 std::vector< int > activeLabelIds;
218 void init( std::size_t featureCount )
220 activeLabelIds.resize( featureCount, -1 );
225 double mNbOverlap = 0.0;
227 Chain *chain(
int seed );
231 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.