vert_tree Union Reference
[Vertex Trees]

Collaboration diagram for vert_tree:
Collaboration graph
[legend]

Data Structures

struct  vert_leaf
struct  vert_node

Data Fields

char type
struct vert_tree::vert_leaf vleaf
struct vert_tree::vert_node vnode

Detailed Description

Structure to make vertex searching fast.

Each leaf represents a vertex, and has an index into the vertices array ("the_array")

Each node is a cutting plane at the "cut_val" on the "coord" (0, 1, or 2) axis.

All vertices with "coord" value less than the "cut_val" are in the "lower" subtree, others are in the "higher".

Definition at line 57 of file vert_tree.c.


Field Documentation

char type

type - leaf or node

Definition at line 58 of file vert_tree.c.

Referenced by Add_vert(), and Add_vert_and_norm().

Referenced by Add_vert(), and Add_vert_and_norm().

Referenced by Add_vert(), and Add_vert_and_norm().


The documentation for this union was generated from the following file:
Generated on Tue Dec 11 13:14:30 2012 for LIBBN by  doxygen 1.6.3