37 const labelList& indices = currentLeaf_->indices();
39 sortedIntersections_.
setSize(indices.size());
48 bool hit = tree_.shapes().intersects
56 if (hit && (indices[elemI] != lastElem_))
58 sortedIntersections_[nHits++] = pointHitSort
72 sortedIntersections_.setSize(nHits);
90 lastElem_ = sortedIntersections_[nHits - 1].index();
102 template <
class Type>
110 point start(leafExitPoint_);
111 currentLeaf_ = tree_.findLeafLine(start, endPoint_, leafExitPoint_);
120 calcSortedIntersections();
122 while (sortedIntersections_.empty());
130 template <
class Type>
134 const point& startPoint,
135 const point& endPoint
139 startPoint_(startPoint),
141 realStartPoint_(startPoint),
142 leafExitPoint_(startPoint_),
144 sortedIntersections_(0),
152 template <
class Type>
159 template <
class Type>
166 if (sortedI_ >= sortedIntersections_.size())