|
libosmscout 0.1
|
#include <osmscout/Area.h>#include <osmscout/GeoCoord.h>#include <osmscout/Point.h>#include <osmscout/util/GeoBox.h>#include <osmscout/util/Geometry.h>#include <osmscout/util/PolygonCenter.h>#include <osmscout/log/Logger.h>#include <queue>#include <vector>Namespaces | |
| namespace | osmscout |
| Original source: https://github.com/philipperemy/easy-encryption/blob/master/b64.h licensed under terms of MIT license. | |
Typedefs | |
| using | osmscout::Polygon = std::vector< const Ring * > |
| using | osmscout::Ring = std::vector< Point > |
Functions | |
| Cell | osmscout::getCentroidCell (const Polygon &polygon) |
| double | osmscout::getSegDistSq (const GeoCoord &p, const Point &a, const Point &b) |
| auto | osmscout::pointToPolygonDist (const GeoCoord &point, const Polygon &polygon) |
| GeoCoord | osmscout::PolygonCenter (const Area &area, double precision=1) |
| A fast algorithm for finding polygon pole of inaccessibility, the most distant internal point from the polygon outline (not to be confused with centroid). | |
| GeoCoord | osmscout::PolygonCenter (const Polygon &polygon, const GeoBox &envelope, double precision) |
| GeoCoord | osmscout::PolygonCenter (const std::vector< Point > &polygon, double precision=1) |