-
finds the triangle the query point falls in, note if out-side of this triangulation a half
plane triangle will be returned (see contains), the search has expected time of O(n^0.5), and
it starts form a fixed triangle (this.startTriangle),
finds the triangle the query point falls in, note if out-side of this triangulation a half
plane triangle will be returned (see contains). the search starts from the the start triangle
Finds a triangle near the given point
returns the consecutive triangle which shares this triangle a,b edge.
returns the consecutive triangle which shares this triangle b,c edge.
returns the consecutive triangle which shares this triangle c,a edge.
returns an iterator object involved in the last update.
computes the current set (vector) of all triangles and return an iterator to them.
Calculates a Voronoi cell for a given neighborhood in this triangulation.
finds the triangle the query point falls in, note if out-side of this triangulation a half
plane triangle will be returned (see contains). the search starts from the the start triangle
void
void
void
static void
static void
static void
static void
void
Updates the grid index to reflect changes to the triangulation.
-