* Tells whether the user wants to abort the triangulation at the earliest * opportunity */

Test if point is inside a box

Next triangle adjacent to a vertex (clockwise) @returns pair of next triangle and the other vertex of a common edge

* Called at the start of adding a constraint edge to the triangulation * @param edge constraint that is added/enforced */

* Called at the start of adding new vertex to the triangulation * @param iV index of the vertex * @param vertexType what type of vertex is b

* Called just before an edge between tro triangles is flipped * @param iT index of the first triangle sharing an edge * @param iTopo index o

* Called when inserted vertex is inside a triangle. * The triangle is split in three: original trianlge is re-purposed and two * new triangl

* Called when inserted vertex is on an edge. * Two triangles sharing an edge are split in four:original triangles are * re-purposed and two

* Called when inserting a constraint edge causes polygon containing * triangles to be re-triangulated * @tris triangles in the polygon that

Not-equals operator

Hash operator

Hash operator

Hash operator

functor's operator

Previous triangle adjacent to a vertex (counter-clockwise) @returns pair of previous triangle and the other vertex of a common edge

* @returns `true` for dark-mode, `false` for light-mode system preference

* @returns `true` for dark-mode, `false` for light-mode user preference

V1 getter

V2 getter

Test which child point belongs to after the split @returns 0 if first child, 1 if second child