}else return curveindex < rhs.curveindex;
}
- bool operator >(const ipoint &rhs) const
+ bool operator>(const ipoint &rhs) const
{
return rhs < *this;
}
Performance annoyances:
1) Recursing down to find an intersection at the end points that doesn't actually exist
- (can be helped a bit by not including the edges of bouding rectaingles)
+ (can be helped a bit by not including the edges of bounding rectangles)
2) Intersecting curves is slow... oh well
Algorithm:
- only works with odd-even rule
*/
-CurveSet CurveSet::operator &(const CurveSet &/*rhs*/) const
+CurveSet CurveSet::operator&(const CurveSet &/*rhs*/) const
{
return *this;
}
-CurveSet CurveSet::operator |(const CurveSet &/*rhs*/) const
+CurveSet CurveSet::operator|(const CurveSet &/*rhs*/) const
{
return *this;
}
-CurveSet CurveSet::operator -(const CurveSet &/*rhs*/) const
+CurveSet CurveSet::operator-(const CurveSet &/*rhs*/) const
{
return *this;
}