Searched refs:WArc (Results 1 – 2 of 2) sorted by relevance
| /dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/ |
| H A D | pointcloud_normal.h | 49 class WArc
52 WArc(VertexPointer _s,VertexPointer _t):src(_s),trg(_t),w(fabs(_s->cN()*_t->cN())){} in WArc() function
57 bool operator< (const WArc &a) const {return w<a.w;}
88 …rsToHeap( MeshType &m, VertexPointer vp, int nn, KdTree<ScalarType> &tree, std::vector<WArc> &heap) in AddNeighboursToHeap()
102 heap.push_back(WArc(vp,&(m.vert[neightId]))); in AddNeighboursToHeap()
157 std::vector<WArc> heap;
173 WArc a = heap.back();
|
| /dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
| H A D | pointcloud_normal.h | 49 class WArc
52 WArc(VertexPointer _s,VertexPointer _t):src(_s),trg(_t),w(fabs(_s->cN()*_t->cN())){} in WArc() function
57 bool operator< (const WArc &a) const {return w<a.w;}
88 …rsToHeap( MeshType &m, VertexPointer vp, int nn, KdTree<ScalarType> &tree, std::vector<WArc> &heap) in AddNeighboursToHeap()
102 heap.push_back(WArc(vp,&(m.vert[neightId]))); in AddNeighboursToHeap()
157 std::vector<WArc> heap;
173 WArc a = heap.back();
|