libosmscout 1.1.1
Loading...
Searching...
No Matches
p2t::SweepContext Class Reference

#include <libosmscout-map-opengl/include/poly2tri/sweep/sweep_context.h>

Collaboration diagram for p2t::SweepContext:

Classes

struct  Basin
struct  EdgeEvent

Public Member Functions

 SweepContext (const std::vector< Point * > &polyline)
 Constructor.
 ~SweepContext ()
 Destructor.
void set_head (Point *p1)
Pointhead ()
void set_tail (Point *p1)
Pointtail ()
int point_count ()
NodeLocateNode (Point &point)
void RemoveNode (Node *node)
void CreateAdvancingFront (std::vector< Node * > nodes)
void MapTriangleToNodes (Triangle &t)
 Try to map a node to all sides of this triangle that don't have a neighbor.
void AddToMap (Triangle *triangle)
PointGetPoint (const int &index)
PointGetPoints ()
void RemoveFromMap (Triangle *triangle)
void AddHole (const std::vector< Point * > &polyline)
void AddPoint (Point *point)
AdvancingFrontfront ()
void MeshClean (Triangle &triangle)
std::vector< Triangle * > GetTriangles ()
std::list< Triangle * > GetMap ()

Public Attributes

std::vector< Edge * > edge_list
Basin basin
EdgeEvent edge_event

Friends

class Sweep

Constructor & Destructor Documentation

◆ SweepContext()

p2t::SweepContext::SweepContext ( const std::vector< Point * > & polyline)
explicit

Constructor.

◆ ~SweepContext()

p2t::SweepContext::~SweepContext ( )

Destructor.

Member Function Documentation

◆ 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()

AdvancingFront * p2t::SweepContext::front ( )
inline

◆ 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

friend class Sweep
friend

Member Data Documentation

◆ basin

Basin p2t::SweepContext::basin

◆ edge_event

EdgeEvent p2t::SweepContext::edge_event

◆ edge_list

std::vector<Edge*> p2t::SweepContext::edge_list

The documentation for this class was generated from the following file: