6 #include "../persistence/RedBlackTree.hpp"
9 namespace point_location {
18 bool operator < (
const Point &o)
const;
19 bool operator == (
const Point &o)
const;
23 typedef std::vector<Point> Polygon;
72 std::vector<std::pair<Point, int>> slabs;
Um ponto em 2D.
Definition: PointLocation.hpp:12
PointLocationSolver(std::vector< Polygon > polygons)
Construtor.
Um segmento em 2D Garantimos que from.x ≤ to.x.
Definition: PointLocation.hpp:29
double x
Coordenada X.
Definition: PointLocation.hpp:14
Árvore rubro-negra (ARN) parcialmente persistente.
Definition: RedBlackTree.hpp:123
Point to
Ponto de fim.
Definition: PointLocation.hpp:35
int WhichPolygon(Point p) const
Consulta de ponto.
Point from
Ponto de origem.
Definition: PointLocation.hpp:33
Estrutura usada para resolver o problema de Point Location.
Definition: PointLocation.hpp:52
double y
Coordenada Y.
Definition: PointLocation.hpp:16
bool operator<(const Segment &o) const
Comparação de segmentos.