rect_node_leaf_new()

RECT_NODE* rect_node_leaf_new	(	const POINTARRAY *	pa,
		int	i
	)

Create a new leaf node, calculating a measure value for each point on the edge and storing pointers back to the end points for later.

Definition at line 128 of file lwtree.c.

References FP_EQUALS, FP_MAX, FP_MIN, getPoint_internal(), rect_node::left_node, lwalloc(), rect_node::p1, rect_node::p2, rect_node::right_node, POINT2D::x, rect_node::xmax, rect_node::xmin, POINT2D::y, rect_node::ymax, and rect_node::ymin.

Referenced by rect_tree_new().

{
        POINT2D *p1, *p2;
        RECT_NODE *node;

        p1 = (POINT2D*)getPoint_internal(pa, i);
        p2 = (POINT2D*)getPoint_internal(pa, i+1);

        /* Zero length edge, doesn't get a node */
        if ( FP_EQUALS(p1->x, p2->x) && FP_EQUALS(p1->y, p2->y) )
                return NULL;

        node = lwalloc(sizeof(RECT_NODE));
        node->p1 = p1;
        node->p2 = p2;
        node->xmin = FP_MIN(p1->x,p2->x);
        node->xmax = FP_MAX(p1->x,p2->x);
        node->ymin = FP_MIN(p1->y,p2->y);
        node->ymax = FP_MAX(p1->y,p2->y);
        node->left_node = NULL;
        node->right_node = NULL;
        return node;
}

Here is the call graph for this function:

Here is the caller graph for this function: