112 	node->pt_outside.x = 0.0;  in circ_node_leaf_new()
113 	node->pt_outside.y = 0.0;  in circ_node_leaf_new()
133 	tree->pt_outside.x = 0.0;  in circ_node_leaf_point_new()
134 	tree->pt_outside.y = 0.0;  in circ_node_leaf_point_new()
346 	node->pt_outside.x = 0.0;  in circ_node_internal_new()
347 	node->pt_outside.y = 0.0;  in circ_node_internal_new()
495 int circ_tree_contains_point(const CIRC_NODE* node, const POINT2D* pt, const POINT2D* pt_outside, i…  in circ_tree_contains_point()  argument
505 	geographic_point_init(pt_outside->x, pt_outside->y, &(stab_edge.end));  in circ_tree_contains_point()
546 					pt_outside->x, pt_outside->y  in circ_tree_contains_point()
577 				c += circ_tree_contains_point(node->nodes[i], pt, pt_outside, level + 1, on_boundary);  in circ_tree_contains_point()
715 		if ( circ_tree_contains_point(n1, &pt, &(n1->pt_outside), 0, NULL) )  in circ_tree_distance_tree_internal()
731 		if ( circ_tree_contains_point(n2, &pt, &(n2->pt_outside), 0, NULL) )  in circ_tree_distance_tree_internal()
889   			printf(" O(%.5g %.5g)", node->pt_outside.x, node->pt_outside.y);  in circ_tree_print()
907   			printf(" O(%.15g %.15g)", node->pt_outside.x, node->pt_outside.y);  in circ_tree_print()
970 	lwpoly_pt_outside(lwpoly, &(node->pt_outside));  in lwpoly_calculate_circ_tree()