Which data structure should I use for hierarchical T-meshes and PHT-splines? Recently, I'm working on something about polynomial splines over hierarchical T-meshes, which is basically a rectangular grid that allows T-junctions. I want to do some numerical experiments but I don't know how to represent T-meshes and splines over it in a computer. I'm going to study about PHT-splines and Hermite splines over T-meshes.
So my problem is: Which data structure should I use for them? Thank you~
I've tried to search for it on google. But all I found are about mathematical analysis of them and none is about the data structure.
Note: For details of T-meshes and PHT splines you can refer to this article (doi:10.1016/j.gmod.2008.03.001) in Graphical Models 70 (2008) 76–86:
[pdf] Polynomial splines over hierarchical T-meshes
 A: PHT-Splines are hierarchical, and therefore recursive in nature.  I use a kd-tree structure for my surfaces.  This facilitates a fast lookup when querying on (x,y) or (u,v).
There are a number of ways you can manage the storage.  I actually store the full set of Bezier control points for my bicubic patches in each leaf.  It's not the most space efficient, but it is fairly convenient for evaluation.
A: There is literature on how to represent T-meshes. For example, the paper below
acknowledges that the flexibility of T-meshes make them difficult to represent in a
data structure. So they 
"recommend using the extended T-mesh instead of the original one. We will
show that, the extended T-mesh can be represented by a obj-like format ﬁle, and converted into a
simple face-edge-vertex data structure easily."

"Extended T-mesh and Data Structure for the Easy
  Computation of T-spline."
  Hongwei Lin, Ye Cai, Shuming Gao.
  Journal of Information & Computational Science 9: 3 (2012) 583–593.
  (Journal link)
  

