Lines Matching refs:m_Nodes
119 m_Nodes.resize(binsDim1); in initBaseTrees()
124 m_Nodes[i1].resize(binsDim2); in initBaseTrees()
178 m_Nodes[r][c].pos[0] = r; in fillBaseTrees()
179 m_Nodes[r][c].pos[1] = c; in fillBaseTrees()
180 m_Nodes[r][c].d = *(p1++)-*(p2++); in fillBaseTrees()
181 m_Nodes[r][c].pParent = NULL; in fillBaseTrees()
182 m_Nodes[r][c].pChild = NULL; in fillBaseTrees()
183 m_Nodes[r][c].iLevel = -1; in fillBaseTrees()
187 m_EdgesRight[r][c].pParent = &(m_Nodes[r][c]); in fillBaseTrees()
188 m_EdgesRight[r][c].pChild = &(m_Nodes[r][(c+1)%binsDim2]); in fillBaseTrees()
194 m_EdgesUp[r][c].pParent = &(m_Nodes[r][c]); in fillBaseTrees()
195 m_EdgesUp[r][c].pChild = &(m_Nodes[(r+1)%binsDim1][c]); in fillBaseTrees()
260 for(c=0; c<binsDim2; c++) D[r][c] = m_Nodes[r][c].d; in greedySolution2()
441 m_pRoot = dimension==2 ? &(m_Nodes[r][c]) : &(m_3dNodes[r][c][z]); in initBVTree()
479 if(k==0 && c>0) pNxtN = &(m_Nodes[r][c-1]); // left in initBVTree()
480 else if(k==1 && r>0) pNxtN = &(m_Nodes[r-1][c]); // down in initBVTree()
481 else if(k==2 && c<binsDim2-1) pNxtN = &(m_Nodes[r][c+1]); // right in initBVTree()
482 else if(k==3 && r<binsDim1-1) pNxtN = &(m_Nodes[r+1][c]); // up in initBVTree()