38 return _vertices.size();
61 return check_left_winding(_polygon);
69 INLINE Triangulator::Triangle::
71 _v0(t->vert[v0].user_i),
72 _v1(t->vert[v1].user_i),
73 _v2(t->vert[v2].user_i)
82 INLINE Triangulator::segment_t::
91 INLINE Triangulator::segment_t::
92 segment_t(
Triangulator *t,
int v0_i,
int v1_i,
int prev,
int next) :
99 v0.x = t->_vertices[v0_i][0];
100 v0.y = t->_vertices[v0_i][1];
102 v1.x = t->_vertices[v1_i][0];
103 v1.y = t->_vertices[v1_i][1];
static const LPoint2d & zero()
Returns a zero-length point.
int get_num_vertices() const
Returns the number of vertices in the pool.
This is a two-component point in space.
const LPoint2d & get_vertex(int n) const
Returns the nth vertex.
This class can triangulate a convex or concave polygon, even one with holes.
bool is_left_winding() const
Returns true if the polygon vertices are listed in counterclockwise order, or false if they appear to...
int add_vertex(const LPoint2d &point)
Adds a new vertex to the vertex pool.