38 const edge&
e = edges_[edgeI];
39 const point& p0 = points_[e[0]];
40 const point& p1 = points_[e[1]];
42 return treeBoundBox(
min(p0, p1),
max(p0, p1));
59 edgeLabels_(edgeLabels),
64 bbs_.setSize(edgeLabels_.size());
68 bbs_[i] = calcBb(edgeLabels_[i]);
82 const edge& e = edges_[edgeLabels_[i]];
84 eMids[i] = e.
centre(points_);
111 return cubeBb.
overlaps(bbs_[index]);
115 return cubeBb.
overlaps(calcBb(edgeLabels_[index]));
127 scalar& nearestDistSqr,
134 label index = indices[i];
136 const edge& e = edges_[edgeLabels_[index]];
142 if (distSqr < nearestDistSqr)
144 nearestDistSqr = distSqr;
166 scalar nearestDistSqr =
magSqr(linePoint - nearestPoint);
170 label index = indices[i];
172 const edge& e = edges_[edgeLabels_[index]];
179 scalar distSqr =
sqr(dist);
181 if (distSqr < nearestDistSqr)
183 nearestDistSqr = distSqr;
186 nearestPoint = ePoint;