#include <volume_io/internal_volume_io.h>
#include <bicpl/data_structures.h>
#include <bicpl/geom.h>
Include dependency graph for ray_bintree.c:
Go to the source code of this file.
Functions | |
private void | recursive_intersect_ray (Point *origin, Vector *direction, Real t_min, Real t_max, bintree_node_struct *node, object_struct *object, int *obj_index, Real *closest_dist, int *n_intersections, Real *distances[]) |
public void | print_bintree_stats (int n_objects) |
public int | intersect_ray_with_bintree (Point *origin, Vector *direction, bintree_struct_ptr bintree, object_struct *object, int *obj_index, Real *dist, Real *distances[]) |
public BOOLEAN | ray_intersects_range (range_struct *range, Point *origin, Vector *direction, Real *t_min, Real *t_max) |
Variables | |
private int | n_nodes_searched = 0 |
private int | n_objects_searched = 0 |
|
Definition at line 76 of file ray_bintree.c. References bintree_struct::range, ray_intersects_range(), recursive_intersect_ray(), and bintree_struct::root. Referenced by intersect_ray_with_object(). |
|
Definition at line 51 of file ray_bintree.c. References n_nodes_searched, and n_objects_searched. |
|
Definition at line 291 of file ray_bintree.c. References clip_line_to_box(), and range_struct::limits. Referenced by intersect_ray_with_bintree(). |
|
Definition at line 124 of file ray_bintree.c. References bintree_node_is_leaf(), FALSE, get_bintree_leaf_objects(), get_bintree_left_child(), get_bintree_right_child(), get_node_split_axis(), get_node_split_position(), intersect_ray_object(), n_nodes_searched, n_objects_searched, and TRUE. Referenced by intersect_ray_with_bintree(). |
|
Definition at line 35 of file ray_bintree.c. Referenced by print_bintree_stats(), and recursive_intersect_ray(). |
|
Definition at line 36 of file ray_bintree.c. Referenced by print_bintree_stats(), and recursive_intersect_ray(). |