Component of the polygon, trapezoid or triangle.
More...
#include <mission_cell.h>
Component of the polygon, trapezoid or triangle.
For each edge of the cell the mission_directed_cell instance will be created. Each such instance will be checked for the number of waypoints, and only those with a minimal number of waypoints will be kept. When build_path is called we will use closest instance of mission_directed_cell for path construction
◆ point
◆ polygon
◆ mission_cell()
mission_cell::mission_cell |
( |
const polygon & |
poly | ) |
|
|
explicit |
◆ ~mission_cell()
mission_cell::~mission_cell |
( |
| ) |
|
|
default |
◆ waypoint_count()
auto mission_cell::waypoint_count |
( |
| ) |
const |
The minimum number of waypoints the cell can be covered by.
- Note
- Zero number of waypoints can be returned in case if the effective cell area is zero, i.e. cell is the result of approximation error
◆ visited()
auto mission_cell::visited |
( |
| ) |
const |
◆ distance()
auto mission_cell::distance |
( |
const point & |
start | ) |
const |
The distance from point start
to the closest cell waypoint from where path can be constructed.
◆ build_path()
void mission_cell::build_path |
( |
const point & |
start, |
|
|
std::vector< point > * |
result |
|
) |
| |
Build mission path.
- Parameters
-
start | Starting point of the mission path |
result | vector where mission path will be saved |
The documentation for this class was generated from the following files:
- mission_cell.h
- mission_cell.cpp