Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
Go to the source code of this file.
Namespaces | |
namespace | geometry |
namespace | geometry::two_d |
Enumerations | |
enum | geometry::two_d::Quadrant { geometry::two_d::CENTER = 0, geometry::two_d::TOP_RIGHT = 1, geometry::two_d::TOP_LEFT = 2, geometry::two_d::BOTTOM_LEFT = 3, geometry::two_d::BOTTOM_RIGHT = 4 } |
Functions | |
template<typename T > | |
Quadrant | geometry::two_d::getQuadrant (const Point< T > point) |
template<typename T > | |
bool | geometry::two_d::angleLess (const Point< T > point1, const Point< T > point2) |