96 void addCandidatePosition( std::unique_ptr< LabelPosition > position );
132 QList<LabelPosition *> getSolution(
bool returnInactive, QList<LabelPosition *> *unlabeled =
nullptr );
137 void init_sol_falp();
147 return &mPositionsWithNoCandidates;
170 QStringList labelledLayersName;
175 int mTotalCandidates = 0;
185 std::size_t mFeatureCount = 0;
190 bool mDisplayAll =
false;
195 double mMapExtentBounds[4] = {0, 0, 0, 0};
197 std::vector< std::unique_ptr< LabelPosition > > mLabelPositions;
202 std::vector< std::unique_ptr< LabelPosition > > mPositionsWithNoCandidates;
204 std::vector< int > mFeatStartId;
205 std::vector< int > mFeatNbLp;
206 std::vector< double > mInactiveCost;
213 std::vector< int > activeLabelIds;
215 void init( std::size_t featureCount )
217 activeLabelIds.resize( featureCount, -1 );
222 double mNbOverlap = 0.0;
224 Chain *chain(
int seed );
228 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(const Problem &other)=delete
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.