30#ifndef LABELPOSITION_H
31#define LABELPOSITION_H
58 friend class PolygonCostCalculator;
94 double alpha,
double cost,
95 FeaturePart *feature,
bool isReversed =
false, Quadrant quadrant = QuadrantOver );
106 bool intersects(
const GEOSPreparedGeometry *geometry );
113 bool within(
const GEOSPreparedGeometry *geometry );
130 void getBoundingBox(
double amin[2],
double amax[2] )
const;
136 bool outerBoundingBoxIntersects(
const LabelPosition *other )
const;
145 double getDistanceToPoint(
double xp,
double yp,
bool useOuterBounds )
const;
152 bool crossesLine(
PointSet *line )
const;
159 bool crossesBoundary(
PointSet *polygon )
const;
165 int polygonIntersectionCost(
PointSet *polygon )
const;
172 bool intersectsWithPolygon(
PointSet *polygon )
const;
207 if ( mNextPart ) mNextPart->setProblemIds( probFid, lpId );
214 double cost()
const {
return mCost; }
221 void setCost(
double newCost ) { mCost = newCost; }
229 void setConflictsWithObstacle(
bool conflicts );
243 void setHasHardObstacleConflict(
bool conflicts );
260 double getX(
int i = 0 )
const;
266 double getY(
int i = 0 )
const;
274 double getAlpha()
const;
293 void setNextPart( std::unique_ptr< LabelPosition > next ) { mNextPart = std::move( next ); }
328 const GEOSPreparedGeometry *preparedMultiPartGeom()
const;
335 const GEOSPreparedGeometry *preparedOuterBoundsGeom()
const;
345 unsigned int globalId()
const {
return mGlobalId; }
358 double angleDifferential();
390 unsigned int mGlobalId = 0;
391 std::unique_ptr< LabelPosition > mNextPart;
393 std::vector< double > mOuterBoundsX;
394 std::vector< double > mOuterBoundsY;
396 double mOuterBoundsXMin = std::numeric_limits<double>::max();
397 double mOuterBoundsXMax = std::numeric_limits<double>::lowest();
398 double mOuterBoundsYMin = std::numeric_limits<double>::max();
399 double mOuterBoundsYMax = std::numeric_limits<double>::lowest();
401 geos::unique_ptr mOuterBoundsGeos;
402 const GEOSPreparedGeometry *mPreparedOuterBoundsGeos =
nullptr;
405 bool mHasObstacleConflict;
406 bool mHasHardConflict =
false;
407 int mUpsideDownCharCount;
412 int partCount()
const;
418 double polygonIntersectionCostForParts(
PointSet *polygon )
const;
423 void createMultiPartGeosGeom()
const;
427 void createOuterBoundsGeom();
A rtree spatial index for use in the pal labeling engine.
Calculates label candidate costs considering different factors.
Main class to handle feature.
LabelPosition is a candidate feature label position.
Quadrant
Position of label candidate relative to feature.
void incrementNumOverlaps()
Increases the number of overlaps recorded against this position by 1.
LabelPosition::Quadrant quadrant
bool hasHardObstacleConflict() const
Returns whether the position is marked as having a hard conflict with an obstacle feature.
void setNextPart(std::unique_ptr< LabelPosition > next)
Sets the next part of this label position (i.e.
void setCost(double newCost)
Sets the candidate label position's geographical cost.
double alpha
Rotation in radians.
int upsideDownCharCount() const
Returns the number of upside down characters for this label position.
void setGlobalId(unsigned int id)
Sets the global id for the candidate, which is unique for a single run of the pal labelling engine.
void decrementNumOverlaps()
Decreases the number of overlaps recorded against this position by 1.
double cost() const
Returns the candidate label position's geographical cost.
Quadrant getQuadrant() const
bool conflictsWithObstacle() const
Returns whether the position is marked as conflicting with an obstacle feature.
int getNumOverlaps() const
void setProblemIds(int probFid, int lpId)
Set problem feature ID and assigned label candidate ID.
void setUpsideDownCharCount(int count)
Sets the count of upside down characters for this label position.
unsigned int globalId() const
Returns the global ID for the candidate, which is unique for a single run of the pal labelling engine...
int getProblemFeatureId() const
bool getUpsideDown() const
LabelPosition * nextPart() const
Returns the next part of this label position (i.e.
The underlying raw pal geometry class.