348
348
// epsilon is only for bbox: then, predicate on element K is exact
349
349
// TODO: compute epsilon with omega.hmin scale ?
350
350
// static const T eps = 1e5*std::numeric_limits<T>::epsilon();
352
353
Interval xe = Interval (cgal_locate_traits<T,D>::make_cgal_point_window (x, eps), 0);
353
354
std::list<Interval> intersected_boxes;
354
355
// point query = inverse range query ; from ::CGAL documentation:
356
357
// We prefered not to offer an extra function for this sort of query, since the inverse range
357
358
// query is a special case of the range query (window_query)"
358
359
_tree.window_query (xe, std::back_inserter(intersected_boxes));