Searched refs:neightId (Results 1 – 7 of 7) sorted by relevance
57 int neightId = -1; in MakeKNNTree() local64 neightId = p.getIndex(i); in MakeKNNTree()65 if (neightId < m.vn && (neightId != j)) in MakeKNNTree()66 kNeighboursVect[m.vert[j]]->push_back(&(m.vert[neightId])); in MakeKNNTree()
78 int neightId = nq.getIndex(i);80 ptVec.push_back(m.vert[neightId].cP());97 int neightId = nq.getIndex(i); in AddNeighboursToHeap() local98 if (neightId < m.vn && (&m.vert[neightId] != vp)) in AddNeighboursToHeap()100 if(!m.vert[neightId].IsV()) in AddNeighboursToHeap()102 heap.push_back(WArc(vp,&(m.vert[neightId]))); in AddNeighboursToHeap()
1251 int neightId = nq.getIndex(i);1252 if(m.vert[neightId].cN()*vi->cN()>0)1253 TD[vi]+= m.vert[neightId].cN();1255 TD[vi]-= m.vert[neightId].cN();
1369 int neightId = nq.getIndex(i);1370 if (m.vert[neightId].cN() * vi->cN() > 0)1371 TD[vi] += m.vert[neightId].cN();1373 TD[vi] -= m.vert[neightId].cN();
78 int neightId = queue.getIndex(i); in main() local79 avgDist += Distance(m.vert[j].cP(),m.vert[neightId].cP()); in main()
179 int neightId = tree.getNeighborId(k); in toLowFreq() local180 pointToFit.push_back(vert[act][neightId]); in toLowFreq()