Go to the source code of this file.
|
| void | circ_tree_print (const CIRC_NODE *node, int depth) |
| |
| CIRC_NODE * | circ_tree_new (const POINTARRAY *pa) |
| | Build a tree of nodes from a point array, one node per edge. More...
|
| |
| void | circ_tree_free (CIRC_NODE *node) |
| | Recurse from top of node tree and free all children. More...
|
| |
| int | circ_tree_contains_point (const CIRC_NODE *node, const POINT2D *pt, const POINT2D *pt_outside, int level, int *on_boundary) |
| | Walk the tree and count intersections between the stab line and the edges. More...
|
| |
| double | circ_tree_distance_tree (const CIRC_NODE *n1, const CIRC_NODE *n2, const SPHEROID *spheroid, double threshold) |
| |
| CIRC_NODE * | lwgeom_calculate_circ_tree (const LWGEOM *lwgeom) |
| |
| int | circ_tree_get_point (const CIRC_NODE *node, POINT2D *pt) |
| | Returns a POINT2D that is a vertex of the input shape. More...
|
| |
| int | circ_tree_get_point_outside (const CIRC_NODE *node, POINT2D *pt) |
| |