public LSeg(PMQTree o, IHasLine v)
{
m_nodes = new LinkedList <LNode>();
m_v = v;
m_o = o;
m_keyval = m_o.segKey();
}
public LNode(PMQTree o, Aabb bound) : base(o, bound)
{
m_segs = new Dictionary <int, Pair <LSeg, LinkedListNode <LNode> > >();
}
public RootNode(PMQTree o) : base(o, new Aabb(0, 0, 0, 0))
{
m_s = null;
}
public QNode(PMQTree o, Aabb b, Node vll, Node vlr, Node vul, Node vur) : base(o, b)
{
ll = vll; lr = vlr; ul = vul; ur = vur;
}
public Node(PMQTree o, Aabb b)
{
m_o = o; m_bound = b;
}