lwpoly_calculate_circ_tree()

static CIRC_NODE* lwpoly_calculate_circ_tree ( const LWPOLY *  lwpoly )

static

Definition at line 887 of file lwgeodetic_tree.c.

References circ_nodes_merge(), circ_nodes_sort(), circ_tree_new(), circ_node::geom_type, lwalloc(), lwfree(), lwgeom_get_type(), lwpoly_pt_outside(), LWPOLY::nrings, circ_node::pt_outside, and LWPOLY::rings.

Referenced by lwgeom_calculate_circ_tree().

{
        int i = 0, j = 0;
        CIRC_NODE** nodes;
        CIRC_NODE* node;

        /* One ring? Handle it like a line. */
        if ( lwpoly->nrings == 1 )
        {
                node = circ_tree_new(lwpoly->rings[0]);
        }
        else
        {
                /* Calculate a tree for each non-trivial ring of the polygon */
                nodes = lwalloc(lwpoly->nrings * sizeof(CIRC_NODE*));
                for ( i = 0; i < lwpoly->nrings; i++ )
                {
                        node = circ_tree_new(lwpoly->rings[i]);
                        if ( node )
                                nodes[j++] = node;
                }
                /* Put the trees into a spatially correlated order */
                circ_nodes_sort(nodes, j);
                /* Merge the trees pairwise up to a parent node and return */
                node = circ_nodes_merge(nodes, j);
                /* Don't need the working list any more */
                lwfree(nodes);
        }

        /* Metatdata about polygons, we need this to apply P-i-P tests */
        /* selectively when doing distance calculations */
        node->geom_type = lwgeom_get_type((LWGEOM*)lwpoly);
        lwpoly_pt_outside(lwpoly, &(node->pt_outside));

        return node;
}

Here is the call graph for this function:

Here is the caller graph for this function: