void Precompute_Patch_Values(BICUBIC_PATCH *Shape)
{
int i, j;
VECTOR Control_Points[16];
VECTOR(*Patch_Ptr)[4][4] = (VECTOR(*)[4][4]) Shape->Control_Points;
int max_depth_reached = 0;
/* Calculate the bounding sphere for the entire patch. */
for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
Assign_Vector(Control_Points[4*i + j], Shape->Control_Points[i][j]);
}
}
find_average(16, Control_Points, Shape->Bounding_Sphere_Center, &Shape->Bounding_Sphere_Radius);
if (Shape->Patch_Type == 1)
{
if (Shape->Node_Tree != NULL)
{
bezier_tree_deleter(Shape->Node_Tree);
}
Shape->Node_Tree = bezier_tree_builder(Shape, Patch_Ptr, 0.0, 1.0, 0.0, 1.0, 0, max_depth_reached);
}
}
void BicubicPatch::Precompute_Patch_Values()
{
int max_depth_reached = 0;
if (Patch_Type == 1)
{
if (Node_Tree != NULL)
{
bezier_tree_deleter(Node_Tree);
}
Node_Tree = bezier_tree_builder(&Control_Points, 0.0, 1.0, 0.0, 1.0, 0, max_depth_reached);
}
}
BEZIER_NODE *BicubicPatch::bezier_tree_builder(const ControlPoints *Patch, DBL u0, DBL u1, DBL v0, DBL v1, int depth, int& max_depth_reached)
{
ControlPoints Lower_Left, Lower_Right;
ControlPoints Upper_Left, Upper_Right;
BEZIER_CHILDREN *Children;
BEZIER_VERTICES *Vertices;
BEZIER_NODE *Node = create_new_bezier_node();
if (depth > max_depth_reached)
{
max_depth_reached = depth;
}
/* Build the bounding sphere for this subpatch. */
bezier_bounding_sphere(Patch, Node->Center, &(Node->Radius_Squared));
/*
* If the patch is close to being flat, then just perform
* a ray-plane intersection test.
*/
if (flat_enough(Patch))
{
/* The patch is now flat enough to simply store the corners. */
Node->Node_Type = BEZIER_LEAF_NODE;
Vertices = create_bezier_vertex_block();
Vertices->Vertices[0] = (*Patch)[0][0];
Vertices->Vertices[1] = (*Patch)[0][3];
Vertices->Vertices[2] = (*Patch)[3][3];
Vertices->Vertices[3] = (*Patch)[3][0];
Vertices->uvbnds[0] = u0;
Vertices->uvbnds[1] = u1;
Vertices->uvbnds[2] = v0;
Vertices->uvbnds[3] = v1;
Node->Data_Ptr = reinterpret_cast<void *>(Vertices);
}
else
{
if (depth >= U_Steps)
{
if (depth >= V_Steps)
{
/* We are at the max recursion depth. Just store corners. */
Node->Node_Type = BEZIER_LEAF_NODE;
Vertices = create_bezier_vertex_block();
Vertices->Vertices[0] = (*Patch)[0][0];
Vertices->Vertices[1] = (*Patch)[0][3];
Vertices->Vertices[2] = (*Patch)[3][3];
Vertices->Vertices[3] = (*Patch)[3][0];
Vertices->uvbnds[0] = u0;
Vertices->uvbnds[1] = u1;
Vertices->uvbnds[2] = v0;
Vertices->uvbnds[3] = v1;
Node->Count = 0;
Node->Data_Ptr = reinterpret_cast<void *>(Vertices);
}
else
{
bezier_split_up_down(Patch, &Lower_Left, &Upper_Left);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(&Lower_Left, u0, u1, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(&Upper_Left, u0, u1, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Node->Count = 2;
Node->Data_Ptr = reinterpret_cast<void *>(Children);
}
}
else
{
if (depth >= V_Steps)
{
bezier_split_left_right(Patch, &Lower_Left, &Lower_Right);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(&Lower_Left, u0, (u0 + u1) / 2.0, v0, v1, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(&Lower_Right, (u0 + u1) / 2.0, u1, v0, v1, depth + 1, max_depth_reached);
Node->Count = 2;
Node->Data_Ptr = reinterpret_cast<void *>(Children);
}
else
{
bezier_split_left_right(Patch, &Lower_Left, &Lower_Right);
bezier_split_up_down(&Lower_Left, &Lower_Left, &Upper_Left);
bezier_split_up_down(&Lower_Right, &Lower_Right, &Upper_Right);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(&Lower_Left, u0, (u0 + u1) / 2.0, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(&Upper_Left, u0, (u0 + u1) / 2.0, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Children->Children[2] = bezier_tree_builder(&Lower_Right, (u0 + u1) / 2.0, u1, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[3] = bezier_tree_builder(&Upper_Right, (u0 + u1) / 2.0, u1, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Node->Count = 4;
Node->Data_Ptr = reinterpret_cast<void *>(Children);
}
}
}
return (Node);
}
static BEZIER_NODE *bezier_tree_builder(BICUBIC_PATCH *Object, VECTOR (*Patch)[4][4], DBL u0, DBL u1, DBL v0, DBL v1, int depth, int& max_depth_reached)
{
VECTOR Lower_Left[4][4], Lower_Right[4][4];
VECTOR Upper_Left[4][4], Upper_Right[4][4];
BEZIER_CHILDREN *Children;
BEZIER_VERTICES *Vertices;
BEZIER_NODE *Node = create_new_bezier_node();
if (depth > max_depth_reached)
{
max_depth_reached = depth;
}
/* Build the bounding sphere for this subpatch. */
bezier_bounding_sphere(Patch, Node->Center, &(Node->Radius_Squared));
/*
* If the patch is close to being flat, then just perform
* a ray-plane intersection test.
*/
if (flat_enough(Object, Patch))
{
/* The patch is now flat enough to simply store the corners. */
Node->Node_Type = BEZIER_LEAF_NODE;
Vertices = create_bezier_vertex_block();
Assign_Vector(Vertices->Vertices[0], (*Patch)[0][0]);
Assign_Vector(Vertices->Vertices[1], (*Patch)[0][3]);
Assign_Vector(Vertices->Vertices[2], (*Patch)[3][3]);
Assign_Vector(Vertices->Vertices[3], (*Patch)[3][0]);
Vertices->uvbnds[0] = u0;
Vertices->uvbnds[1] = u1;
Vertices->uvbnds[2] = v0;
Vertices->uvbnds[3] = v1;
Node->Data_Ptr = (void *)Vertices;
}
else
{
if (depth >= Object->U_Steps)
{
if (depth >= Object->V_Steps)
{
/* We are at the max recursion depth. Just store corners. */
Node->Node_Type = BEZIER_LEAF_NODE;
Vertices = create_bezier_vertex_block();
Assign_Vector(Vertices->Vertices[0], (*Patch)[0][0]);
Assign_Vector(Vertices->Vertices[1], (*Patch)[0][3]);
Assign_Vector(Vertices->Vertices[2], (*Patch)[3][3]);
Assign_Vector(Vertices->Vertices[3], (*Patch)[3][0]);
Vertices->uvbnds[0] = u0;
Vertices->uvbnds[1] = u1;
Vertices->uvbnds[2] = v0;
Vertices->uvbnds[3] = v1;
Node->Data_Ptr = (void *)Vertices;
}
else
{
bezier_split_up_down(Patch, (VECTOR(*)[4][4])Lower_Left, (VECTOR(*)[4][4])Upper_Left);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Lower_Left, u0, u1, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Upper_Left, u0, u1, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Node->Count = 2;
Node->Data_Ptr = (void *)Children;
}
}
else
{
if (depth >= Object->V_Steps)
{
bezier_split_left_right(Patch, (VECTOR(*)[4][4])Lower_Left, (VECTOR(*)[4][4])Lower_Right);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Lower_Left, u0, (u0 + u1) / 2.0, v0, v1, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Lower_Right, (u0 + u1) / 2.0, u1, v0, v1, depth + 1, max_depth_reached);
Node->Count = 2;
Node->Data_Ptr = (void *)Children;
}
else
{
bezier_split_left_right(Patch, (VECTOR(*)[4][4])Lower_Left, (VECTOR(*)[4][4])Lower_Right);
bezier_split_up_down((VECTOR(*)[4][4])Lower_Left, (VECTOR(*)[4][4])Lower_Left, (VECTOR(*)[4][4])Upper_Left);
bezier_split_up_down((VECTOR(*)[4][4])Lower_Right, (VECTOR(*)[4][4])Lower_Right, (VECTOR(*)[4][4])Upper_Right);
Node->Node_Type = BEZIER_INTERIOR_NODE;
Children = create_bezier_child_block();
Children->Children[0] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Lower_Left, u0, (u0 + u1) / 2.0, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[1] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Upper_Left, u0, (u0 + u1) / 2.0, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Children->Children[2] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Lower_Right, (u0 + u1) / 2.0, u1, v0, (v0 + v1) / 2.0, depth + 1, max_depth_reached);
Children->Children[3] = bezier_tree_builder(Object, (VECTOR(*)[4][4])Upper_Right, (u0 + u1) / 2.0, u1, (v0 + v1) / 2.0, v1, depth + 1, max_depth_reached);
Node->Count = 4;
Node->Data_Ptr = (void *)Children;
}
}
}
return (Node);
}