52 #ifdef CHECK_MEMORY_LEAKS
54 #endif // CHECK_MEMORY_LEAKS
64 std::copy(v.begin(), v.end(), std::back_inserter(*
this));
74 copy(p.begin(), p.end(), back_inserter(*
this));
100 for (const_iterator i = begin(); i != end() - 1; i++) {
105 (*(i + 1)).x() - p.
x(),
106 (*(i + 1)).y() - p.
y());
110 (*(end() - 1)).x() - p.
x(),
111 (*(end() - 1)).y() - p.
y());
113 (*(begin())).x() - p.
x(),
114 (*(begin())).y() - p.
y());
116 return (!(fabs(angle) <
M_PI));
122 for (const_iterator i = begin(); i != end() - 1; i++) {
123 if (poly.
around(*i, offset)) {
136 for (const_iterator i = begin(); i != end() - 1; i++) {
151 for (const_iterator i = begin(); i != end() - 1; i++) {
164 for (const_iterator i = begin(); i != end() - 1; i++) {
175 for (const_iterator i = begin(); i != end() - 1; i++) {
194 return at((
int)size() + index);
204 return at((
int)size() + index);
211 const_iterator i = begin();
214 const SUMOReal nextLength = (*i).distanceTo(*(i + 1));
215 if (seenLength + nextLength > pos) {
218 seenLength += nextLength;
219 }
while (++i != end() - 1);
226 const_iterator i = begin();
229 const SUMOReal nextLength = (*i).distanceTo2D(*(i + 1));
230 if (seenLength + nextLength > pos) {
233 seenLength += nextLength;
234 }
while (++i != end() - 1);
244 const_iterator i = begin();
247 SUMOReal nextLength = (*i).distanceTo(*(i + 1));
248 if (seenLength + nextLength > pos) {
249 Line l(*i, *(i + 1));
252 seenLength += nextLength;
253 }
while (++i != end() - 1);
254 Line l(*(end() - 2), *(end() - 1));
260 const_iterator i = begin();
263 SUMOReal nextLength = (*i).distanceTo(*(i + 1));
264 if (seenLength + nextLength > pos) {
265 Line l(*i, *(i + 1));
268 seenLength += nextLength;
269 }
while (++i != end() - 1);
270 Line l(*(end() - 2), *(end() - 1));
282 if (lateralOffset != 0) {
287 return p1 + (p2 - p1) * (pos / dist);
299 if (lateralOffset != 0) {
304 return p1 + (p2 - p1) * (pos / dist);
311 for (const_iterator i = begin(); i != end(); i++) {
322 for (const_iterator i = begin(); i != end(); i++) {
336 const int endIndex = (
int)tmp.size() - 1;
340 if (tmp.
area() != 0) {
342 for (
int i = 0; i < endIndex; i++) {
343 const SUMOReal z = tmp[i].x() * tmp[i + 1].y() - tmp[i + 1].x() * tmp[i].y();
345 x += (tmp[i].x() + tmp[i + 1].x()) * z;
346 y += (tmp[i].y() + tmp[i + 1].y()) * z;
354 for (
int i = 0; i < endIndex; i++) {
356 x += (tmp[i].x() + tmp[i + 1].x()) * length / 2;
357 y += (tmp[i].y() + tmp[i + 1].y()) * length / 2;
360 if (lengthSum == 0) {
364 return Position(x / lengthSum, y / lengthSum);
372 for (
int i = 0; i < static_cast<int>(size()); i++) {
373 (*this)[i] = centroid + (((*this)[i] - centroid) * factor);
381 for (
int i = 0; i < static_cast<int>(size()); i++) {
382 (*this)[i] = centroid + (((*this)[i] - centroid) + offset);
399 for (const_iterator i = begin(); i != end() - 1; i++) {
400 len += (*i).distanceTo(*(i + 1));
408 for (const_iterator i = begin(); i != end() - 1; i++) {
409 len += (*i).distanceTo2D(*(i + 1));
422 const int endIndex = (
int)tmp.size() - 1;
424 for (
int i = 0; i < endIndex; i++) {
425 area += tmp[i].x() * tmp[i + 1].y() - tmp[i + 1].x() * tmp[i].y();
436 for (const_iterator i = begin(); i != end() - 1; i++) {
437 if (poly.
around(*i, offset)) {
451 std::pair<PositionVector, PositionVector>
462 const_iterator it = begin() + 1;
463 SUMOReal next = first.back().distanceTo(*it);
469 next = first.back().distanceTo(*it);
471 if (fabs(where - (seen + next)) >
POSITION_EPS || it == end() - 1) {
474 Line tmpL(first.back(), *it);
475 Position p = tmpL.getPositionAtDistance(where - seen);
482 for (; it != end(); it++) {
485 assert(first.size() >= 2);
486 assert(second.size() >= 2);
487 assert(first.back() == second.front());
489 return std::pair<PositionVector, PositionVector>(first, second);
495 for (PositionVector::const_iterator i = geom.begin(); i != geom.end(); i++) {
496 if (i != geom.begin()) {
513 for (
int i = 0; i < static_cast<int>(size()); i++) {
514 (*this)[i].add(xoff, yoff, zoff);
521 for (
int i = 0; i < static_cast<int>(size()); i++) {
522 (*this)[i].reshiftRotate(xoff, yoff, rot);
530 return atan2(p1.
x(), p1.
y()) < atan2(p2.
x(), p2.
y());
549 if (p1.
x() != p2.
x()) {
550 return p1.
x() < p2.
x();
552 return p1.
y() < p2.
y();
560 return (P1.
x() - P0.
x()) * (P2.
y() - P0.
y()) - (P2.
x() - P0.
x()) * (P1.
y() - P0.
y());
575 for (const_iterator i = begin(); i != end() - 1; i++) {
578 *i, *(i + 1), line.
p1(), line.
p2()));
587 if (back().distanceTo(v[0]) < 2) {
588 copy(v.begin() + 1, v.end(), back_inserter(*
this));
592 Line l1((*
this)[static_cast<int>(size()) - 2], back());
598 (*this)[
static_cast<int>(size()) - 1] = p;
599 copy(v.begin() + 1, v.end(), back_inserter(*
this));
602 copy(v.begin(), v.end(), back_inserter(*
this));
610 if (back().distanceTo(v[0]) < 2) {
611 copy(v.begin() + 1, v.end(), back_inserter(*
this));
613 copy(v.begin(), v.end(), back_inserter(*
this));
632 const_iterator i = begin();
634 while ((i + 1) != end()
636 seen + (*i).distanceTo(*(i + 1)) < beginOffset) {
637 seen += (*i).distanceTo(*(i + 1));
641 while ((i + 1) != end()
643 seen + (*i).distanceTo(*(i + 1)) < endOffset) {
651 seen += (*i).distanceTo(*(i + 1));
674 const_iterator i = begin();
676 while ((i + 1) != end()
678 seen + (*i).distanceTo2D(*(i + 1)) < beginOffset) {
679 seen += (*i).distanceTo2D(*(i + 1));
683 while ((i + 1) != end()
685 seen + (*i).distanceTo2D(*(i + 1)) < endOffset) {
693 seen += (*i).distanceTo2D(*(i + 1));
712 if (currDist >= 0 && currDist < dist) {
717 for (iterator i = begin(); i != end() - 1; i++, currPos++) {
719 if (currDist >= 0 && currDist < dist) {
725 for (
size_t j = 0; j < pos; j++) {
730 (*
this)[0], (*
this)[1], p);
735 if (np != *(begin())) {
737 if (np != *(begin())) {
740 assert(*(begin()) != *(end() - 1));
748 if (beginIndex < 0) {
749 beginIndex += (
int)size();
752 assert(beginIndex < (
int)size());
753 assert(beginIndex + count <= (
int)size());
755 for (
int i = beginIndex; i < beginIndex + count; ++i) {
772 if (currDist >= 0 && currDist < dist) {
777 for (reverse_iterator i = rbegin(); i != rend() - 1; i++, currPos++) {
779 if (currDist >= 0 && currDist < dist) {
785 for (
size_t j = 0; j < pos; j++) {
791 (*
this)[static_cast<int>(size()) - 1], (*
this)[static_cast<int>(size()) - 2], p);
797 if (np != *(end() - 1)) {
799 if (np != *(end() - 1)) {
802 assert(*(begin()) != *(end() - 1));
810 Line tmp(front(), back());
830 for (const_iterator i = begin(); i != end() - 1; i++) {
834 if (dist < minDist) {
835 nearestPos = pos + seen;
838 if (perpendicular && i != begin()) {
841 if (cornerDist < minDist) {
843 minDist = cornerDist;
846 seen += (*i).distanceTo2D(*(i + 1));
858 for (
int i = 0; i < (
int)size(); i++) {
860 if (dist < minDist) {
874 int insertionIndex = 1;
875 for (
int i = 0; i < (
int)size() - 1; i++) {
877 if (dist < minDist) {
878 insertionIndex = i + 1;
883 return insertionIndex;
890 return front().distanceTo(p);
894 for (const_iterator i = begin(); i != end() - 1; i++) {
896 p, *i, *(i + 1), outIntersection));
902 std::vector<SUMOReal>
904 std::vector<SUMOReal> ret;
905 for (const_iterator i = other.begin(); i != other.end() - 1; i++) {
907 copy(atSegment.begin(), atSegment.end(), back_inserter(ret));
913 std::vector<SUMOReal>
915 std::vector<SUMOReal> ret;
917 for (const_iterator i = begin(); i != end() - 1; i++) {
918 Line l((*i), *(i + 1));
923 ret.push_back(atLength + pos);
938 (*
this)[static_cast<int>(size()) - 2], (*
this)[static_cast<int>(size()) - 1], val);
949 for (const_reverse_iterator i = rbegin(); i != rend(); i++) {
962 for (
int i = 0; i < static_cast<int>(size()); i++) {
966 std::pair<SUMOReal, SUMOReal> offsets =
969 from.
y() - offsets.second, from.
z()));
970 }
else if (i == static_cast<int>(size()) - 1) {
973 std::pair<SUMOReal, SUMOReal> offsets =
976 to.
y() - offsets.second, to.
z()));
982 me.
x() - to.
x(), me.
y() - to.
y()) / 2);
986 std::pair<SUMOReal, SUMOReal> off =
991 std::pair<SUMOReal, SUMOReal> offsets =
993 std::pair<SUMOReal, SUMOReal> offsets2 =
996 Position(from.
x() - offsets.first, from.
y() - offsets.second),
997 Position(me.
x() - offsets.first, me.
y() - offsets.second));
1000 Position(me.
x() - offsets2.first, me.
y() - offsets2.second),
1001 Position(to.
x() - offsets2.first, to.
y() - offsets2.second));
1043 assert((
int)size() > pos + 1);
1044 return Line((*
this)[pos], (*
this)[pos + 1]);
1056 return lineAt((
int)size() - 2);
1062 if ((*
this)[0] == back()) {
1069 std::vector<SUMOReal>
1071 std::vector<SUMOReal> ret;
1073 for (i = begin(); i != end(); i++) {
1076 for (i = s.begin(); i != s.end(); i++) {
1086 insert(begin() + index, p);
1088 insert(end() + index, p);
1095 assert(index < static_cast<int>(size()));
1096 assert(index + static_cast<int>(size()) >= 0);
1100 (*this)[index +
static_cast<int>(size())] = p;
1123 return size() >= 2 && (*this)[0] == back();
1130 iterator last = begin();
1131 for (iterator i = begin() + 1; i != end() && (!assertLength || size() > 2);) {
1132 if (last->almostSame(*i, minDist)) {
1147 for (iterator i = begin() + 1; i != end() - 1;) {
1161 if (size() == v2.size()) {
1162 for (
int i = 0; i < (
int)size(); i++) {
1163 if ((*
this)[i] != v2[i]) {
SUMOReal length2D() const
SUMOReal atan2DegreeAngle() const
static std::pair< SUMOReal, SUMOReal > getNormal90D_CW(const Position &beg, const Position &end, SUMOReal length, SUMOReal wanted_offset)
const Position & p2() const
static SUMOReal Angle2D(SUMOReal x1, SUMOReal y1, SUMOReal x2, SUMOReal y2)
void removeColinearPoints()
void pruneFromBeginAt(const Position &p)
static Position intersection_position2D(const Position &p11, const Position &p12, const Position &p21, const Position &p22)
returns the intersection point of the (infinite) lines p11,p12 and p21,p22. If the given lines are pa...
SUMOReal nearest_offset_to_point2D(const Position &p, bool perpendicular=true) const
PositionVector getSubpart2D(SUMOReal beginOffset, SUMOReal endOffset) const
void sortAsPolyCWByAngle()
void replaceAt(int index, const Position &by)
SUMOReal intersectsAtLength2D(const Line &v)
returns distance between myP1 and intersection or -1 if line segments do not intersect ...
void insertAt(int index, const Position &p)
std::vector< SUMOReal > distances(const PositionVector &s) const
SUMOReal atan2DegreeSlope() const
Position getPositionAtDistance2D(SUMOReal offset) const
Position getCentroid() const
Returns the centroid (closes the polygon if unclosed)
bool intersects(const Position &p1, const Position &p2) const
void scaleRelative(SUMOReal factor)
enlarges/shrinks the polygon by a factor based at the centroid
PositionVector getSubpartByIndex(int beginIndex, int count) const
bool partialWithin(const AbstractPoly &poly, SUMOReal offset=0) const
Returns the information whether this polygon lies partially within the given polygon.
static Position extrapolate_second(const Position &p1, const Position &p2, SUMOReal length)
SUMOReal distanceTo(const Position &p2) const
returns the euclidean distance in 3 dimension
bool around(const Position &p, SUMOReal offset=0) const
Returns the information whether the position vector describes a polygon lying around the given point ...
bool almostSame(const Position &p2, SUMOReal maxDiv=POSITION_EPS) const
static Position extrapolate_first(const Position &p1, const Position &p2, SUMOReal length)
SUMOReal beginEndAngle() const
const Position & operator[](int index) const
returns the position at the given index !!! exceptions?
SUMOReal x() const
Returns the x-position.
Position positionAtOffset2D(SUMOReal pos, SUMOReal lateralOffset=0) const
Returns the position at the given length.
A class that stores a 2D geometrical boundary.
#define WRITE_WARNING(msg)
PositionVector reverse() const
SUMOReal slopeDegreeAtOffset(SUMOReal pos) const
Returns the slope at the given length.
PositionVector convexHull() const
~PositionVector()
Destructor.
SUMOReal length2D() const
Returns the length.
Position getPositionAtDistance(SUMOReal offset) const
static SUMOReal nearest_offset_on_line_to_point2D(const Position &l1, const Position &l2, const Position &p, bool perpendicular=true)
Line lineAt(int pos) const
static bool intersects(const Position &p11, const Position &p12, const Position &p21, const Position &p22)
return whether given lines intersect
void push_front_noDoublePos(const Position &p)
const Position & p1() const
void reshiftRotate(SUMOReal xoff, SUMOReal yoff, SUMOReal rot)
A point in 2D or 3D with translation and scaling methods.
Position pop_front()
Removes and returns the position at the fron of the list.
void add(SUMOReal xoff, SUMOReal yoff, SUMOReal zoff)
int indexOfClosest(const Position &p) const
int operator()(const Position &p1, const Position &p2) const
comparing operation
void push_front(const Position &p)
Puts the given position at the front of the list.
static SUMOReal distancePointLine(const Position &point, const Position &lineStart, const Position &lineEnd)
void move2side(SUMOReal amount)
SUMOReal z() const
Returns the z-position.
SUMOReal distance(const Position &p) const
Position positionAtOffset(SUMOReal pos, SUMOReal lateralOffset=0) const
Returns the position at the given length.
int insertAtClosest(const Position &p)
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
void sortByIncreasingXY()
Position intersectsAtPoint(const Position &p1, const Position &p2) const
SUMOReal atan2Angle() const
bool intersects(const Line &l) const
bool operator==(const PositionVector &v2) const
comparing operation
std::pair< PositionVector, PositionVector > splitAt(SUMOReal where) const
Returns the two lists made when this list vector is splitted at the given point.
virtual bool around(const Position &p, SUMOReal offset=0) const =0
void extrapolate(SUMOReal val)
PositionVector()
Constructor.
void extrapolateBy(SUMOReal length)
SUMOReal length() const
Returns the length.
SUMOReal rotationDegreeAtOffset(SUMOReal pos) const
Returns the rotation at the given length.
void push_back(const PositionVector &p)
Appends all positions from the given vector.
void add(SUMOReal x, SUMOReal y)
Makes the boundary include the given coordinate.
PositionVector simpleHull_2D(const PositionVector &V)
void removeDoublePoints(SUMOReal minDist=POSITION_EPS, bool assertLength=false)
Removes positions if too near.
PositionVector intersectionPoints2D(const Line &line) const
int appendWithCrossingPoint(const PositionVector &v)
void scaleAbsolute(SUMOReal offset)
enlarges/shrinks the polygon by an absolute offset based at the centroid
SUMOReal y() const
Returns the y-position.
bool overlapsWith(const AbstractPoly &poly, SUMOReal offset=0) const
Returns the information whether the given polygon overlaps with this Again a boundary may be specifie...
void pruneFromEndAt(const Position &p)
Position getLineCenter() const
SUMOReal distanceTo2D(const Position &p2) const
returns the euclidean distance in the x-y-plane
void move2side(SUMOReal amount)
void push_back_noDoublePos(const Position &p)
static SUMOReal closestDistancePointLine(const Position &point, const Position &lineStart, const Position &lineEnd, Position &outIntersection)
int operator()(const Position &p1, const Position &p2) const
comparing operation
Position getPolygonCenter() const
Returns the arithmetic of all corner points.
SUMOReal area() const
Returns the area (0 for non-closed)
std::vector< SUMOReal > intersectsAtLengths2D(const PositionVector &other) const
For all intersections between this vector and other, return the 2D-length of the subvector from this ...
void closePolygon()
ensures that the last position equals the first
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
void append(const PositionVector &v)
increasing_x_y_sorter()
constructor
bool crosses(const Position &p1, const Position &p2) const
Position intersectsAt(const Line &l) const
PositionVector getSubpart(SUMOReal beginOffset, SUMOReal endOffset) const
SUMOReal isLeft(const Position &P0, const Position &P1, const Position &P2) const
std::ostream & operator<<(std::ostream &os, const PositionVector &geom)