* Erase all dummy triangles * @note Advanced method for manually modifying the triangulation from * outside. Please call it when you know wh

Extend a tree by creating new root with old root and a new node as children

* Extract all edges of triangles * * @param triangles triangles used to extract edges * @return an unordered set of all edges of triangulation */

compute previous power of two

! * Returns: * - intersected triangle index * - index of point on the left of the line * - index of point on the right of the l

compute implicit index of a node's ancestor

Calculate root's box enclosing all root points

Returns indices of three resulting triangles Insert point into triangle: split into 3 triangles: * - create 2 new triangles * - re-use old

Returns indices of four resulting triangles Inserting a point on the edge between two triangles * T1 (top) v1 *

Test if point is inside a box

check if "x" is a power of two

check if node is a "real node"

Default constructor

* Factory method * @note needed for c++03 compatibility (no uniform initialization * available) */

* Flag triangle as dummy * @note Advanced method for manually modifying the triangulation from * outside. Please call it when you know what