#include <sweep_context.h>
◆ SweepContext()
p2t::SweepContext::SweepContext |
( |
const std::vector< Point * > & |
polyline | ) |
|
|
explicit |
◆ ~SweepContext()
p2t::SweepContext::~SweepContext |
( |
| ) |
|
◆ AddHole()
void p2t::SweepContext::AddHole |
( |
const std::vector< Point * > & |
polyline | ) |
|
◆ AddPoint()
void p2t::SweepContext::AddPoint |
( |
Point * |
point | ) |
|
◆ AddToMap()
void p2t::SweepContext::AddToMap |
( |
Triangle * |
triangle | ) |
|
◆ CreateAdvancingFront()
void p2t::SweepContext::CreateAdvancingFront |
( |
std::vector< Node * > |
nodes | ) |
|
◆ front()
◆ GetMap()
std::list<Triangle*> p2t::SweepContext::GetMap |
( |
| ) |
|
◆ GetPoint()
Point* p2t::SweepContext::GetPoint |
( |
const int & |
index | ) |
|
◆ GetPoints()
Point* p2t::SweepContext::GetPoints |
( |
| ) |
|
◆ GetTriangles()
std::vector<Triangle*> p2t::SweepContext::GetTriangles |
( |
| ) |
|
◆ head()
Point * p2t::SweepContext::head |
( |
| ) |
|
|
inline |
◆ LocateNode()
Node& p2t::SweepContext::LocateNode |
( |
Point & |
point | ) |
|
◆ MapTriangleToNodes()
void p2t::SweepContext::MapTriangleToNodes |
( |
Triangle & |
t | ) |
|
Try to map a node to all sides of this triangle that don't have a neighbor.
◆ MeshClean()
void p2t::SweepContext::MeshClean |
( |
Triangle & |
triangle | ) |
|
◆ point_count()
int p2t::SweepContext::point_count |
( |
| ) |
|
|
inline |
◆ RemoveFromMap()
void p2t::SweepContext::RemoveFromMap |
( |
Triangle * |
triangle | ) |
|
◆ RemoveNode()
void p2t::SweepContext::RemoveNode |
( |
Node * |
node | ) |
|
◆ set_head()
void p2t::SweepContext::set_head |
( |
Point * |
p1 | ) |
|
|
inline |
◆ set_tail()
void p2t::SweepContext::set_tail |
( |
Point * |
p1 | ) |
|
|
inline |
◆ tail()
Point * p2t::SweepContext::tail |
( |
| ) |
|
|
inline |
◆ Sweep
◆ basin
Basin p2t::SweepContext::basin |
◆ edge_event
◆ edge_list
std::vector<Edge*> p2t::SweepContext::edge_list |
The documentation for this class was generated from the following file: