#include <PolyLine.h>
Public Types | |
| typedef std::vector< T > ::const_iterator | const_iterator |
| typedef std::vector< T >::iterator | iterator |
Public Member Functions | |
| PolyLine () | |
| PolyLine (const std::vector< T > &aPoints) | |
| const std::vector< T > & | getPoints () const |
| std::vector< T > & | getPoints () |
| size_t | size () const |
| void | push_back (const T &v) |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
| void | setClosed (bool aClosed=true) |
| bool | isClosed () const |
| T | getPosition (float t) const |
| T | getDerivative (float t) const |
| void | scale (const T &scaleFactor, T scaleCenter=T::zero()) |
| void | offset (const T &offsetBy) |
| bool | contains (const Vec2f &pt) const |
| Returns whether the point pt is contained within the boundaries of the PolyLine. | |
Static Public Member Functions | |
| static std::vector< PolyLine > | calcUnion (const std::vector< PolyLine > &a, std::vector< PolyLine > &b) |
| Calculates the boolean union of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes. | |
| static std::vector< PolyLine > | calcIntersection (const std::vector< PolyLine > &a, std::vector< PolyLine > &b) |
| Calculates the boolean intersection of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes. | |
| static std::vector< PolyLine > | calcXor (const std::vector< PolyLine > &a, std::vector< PolyLine > &b) |
| Calculates the boolean XOR (symmetric difference) of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes. | |
| static std::vector< PolyLine > | calcDifference (const std::vector< PolyLine > &a, std::vector< PolyLine > &b) |
| Calculates the boolean difference of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes. | |
| typedef std::vector<T>::const_iterator cinder::PolyLine< T >::const_iterator |
| typedef std::vector<T>::iterator cinder::PolyLine< T >::iterator |
| cinder::PolyLine< T >::PolyLine | ( | ) |
| cinder::PolyLine< T >::PolyLine | ( | const std::vector< T > & | aPoints | ) |
| const std::vector<T>& cinder::PolyLine< T >::getPoints | ( | ) | const |
| std::vector<T>& cinder::PolyLine< T >::getPoints | ( | ) |
| size_t cinder::PolyLine< T >::size | ( | ) | const |
| void cinder::PolyLine< T >::push_back | ( | const T & | v | ) |
| iterator cinder::PolyLine< T >::begin | ( | ) |
| const_iterator cinder::PolyLine< T >::begin | ( | ) | const |
| iterator cinder::PolyLine< T >::end | ( | ) |
| const_iterator cinder::PolyLine< T >::end | ( | ) | const |
| void cinder::PolyLine< T >::setClosed | ( | bool | aClosed = true | ) |
| bool cinder::PolyLine< T >::isClosed | ( | ) | const |
| T cinder::PolyLine< T >::getPosition | ( | float | t | ) | const |
| T cinder::PolyLine< T >::getDerivative | ( | float | t | ) | const |
| void cinder::PolyLine< T >::scale | ( | const T & | scaleFactor, |
| T | scaleCenter = T::zero() |
||
| ) |
| void cinder::PolyLine< T >::offset | ( | const T & | offsetBy | ) |
| bool cinder::PolyLine< T >::contains | ( | const Vec2f & | pt | ) | const |
Returns whether the point pt is contained within the boundaries of the PolyLine.
| std::vector< PolyLine< T > > cinder::PolyLine< T >::calcUnion | ( | const std::vector< PolyLine< T > > & | a, |
| std::vector< PolyLine< T > > & | b | ||
| ) | [static] |
Calculates the boolean union of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes.
| std::vector< PolyLine< T > > cinder::PolyLine< T >::calcIntersection | ( | const std::vector< PolyLine< T > > & | a, |
| std::vector< PolyLine< T > > & | b | ||
| ) | [static] |
Calculates the boolean intersection of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes.
| std::vector< PolyLine< T > > cinder::PolyLine< T >::calcXor | ( | const std::vector< PolyLine< T > > & | a, |
| std::vector< PolyLine< T > > & | b | ||
| ) | [static] |
Calculates the boolean XOR (symmetric difference) of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes.
| std::vector< PolyLine< T > > cinder::PolyLine< T >::calcDifference | ( | const std::vector< PolyLine< T > > & | a, |
| std::vector< PolyLine< T > > & | b | ||
| ) | [static] |
Calculates the boolean difference of a and b. Assumes the first PolyLine in the vector is the outermost and the (optional) others are holes.