circ_node_leaf_new()

static CIRC_NODE* circ_node_leaf_new ( const POINTARRAY *  pa, int  i  )

static

Create a new leaf node, storing pointers back to the end points for later.

Definition at line 67 of file lwgeodetic_tree.c.

References cart2geog(), circ_node::center, circ_node::edge_num, FP_EQUALS, geog2cart(), geographic_point_init(), circ_node::geom_type, getPoint_internal(), GEOGRAPHIC_POINT::lat, GEOGRAPHIC_POINT::lon, lwalloc(), LWDEBUGF, circ_node::nodes, normalize(), circ_node::num_nodes, circ_node::p1, circ_node::p2, circ_node::pt_outside, circ_node::radius, sphere_distance(), vector_sum(), POINT2D::x, and POINT2D::y.

Referenced by circ_tree_new().

{
        POINT2D *p1, *p2;
        POINT3D q1, q2, c;
        GEOGRAPHIC_POINT g1, g2, gc;
        CIRC_NODE *node;
        double diameter;

        p1 = (POINT2D*)getPoint_internal(pa, i);
        p2 = (POINT2D*)getPoint_internal(pa, i+1);
        geographic_point_init(p1->x, p1->y, &g1);
        geographic_point_init(p2->x, p2->y, &g2);

        LWDEBUGF(3,"edge #%d (%g %g, %g %g)", i, p1->x, p1->y, p2->x, p2->y);

        diameter = sphere_distance(&g1, &g2);

        /* Zero length edge, doesn't get a node */
        if ( FP_EQUALS(diameter, 0.0) )
                return NULL;

        /* Allocate */
        node = lwalloc(sizeof(CIRC_NODE));
        node->p1 = p1;
        node->p2 = p2;

        /* Convert ends to X/Y/Z, sum, and normalize to get mid-point */
        geog2cart(&g1, &q1);
        geog2cart(&g2, &q2);
        vector_sum(&q1, &q2, &c);
        normalize(&c);
        cart2geog(&c, &gc);
        node->center = gc;
        node->radius = diameter / 2.0;

        LWDEBUGF(3,"edge #%d CENTER(%g %g) RADIUS=%g", i, gc.lon, gc.lat, node->radius);

        /* Leaf has no children */
        node->num_nodes = 0;
        node->nodes = NULL;
        node->edge_num = i;

        /* Zero out metadata */
        node->pt_outside.x = 0.0;
        node->pt_outside.y = 0.0;
        node->geom_type = 0;

        return node;
}

Here is the call graph for this function:

Here is the caller graph for this function: