33 #define NAMED_RTREE_QUAL RTree<Named*, Named, float, 2, Named::StoringVisitor>
36 inline float NAMED_RTREE_QUAL::RectSphericalVolume(Rect* a_rect) {
38 const float extent0 = a_rect->m_max[0] - a_rect->m_min[0];
39 const float extent1 = a_rect->m_max[1] - a_rect->m_min[1];
40 return .78539816f * (extent0 * extent0 + extent1 * extent1);
44 inline NAMED_RTREE_QUAL::Rect NAMED_RTREE_QUAL::CombineRect(Rect* a_rectA, Rect* a_rectB) {
45 ASSERT(a_rectA && a_rectB);
47 newRect.m_min[0] =
rtree_min(a_rectA->m_min[0], a_rectB->m_min[0]);
48 newRect.m_max[0] =
rtree_max(a_rectA->m_max[0], a_rectB->m_max[0]);
49 newRect.m_min[1] =
rtree_min(a_rectA->m_min[1], a_rectB->m_min[1]);
50 newRect.m_max[1] =
rtree_max(a_rectA->m_max[1], a_rectB->m_max[1]);
82 void Insert(
const float a_min[2],
const float a_max[2],
Named*
const& a_data) {
83 NAMED_RTREE_QUAL::Insert(a_min, a_max, a_data);
93 void Remove(
const float a_min[2],
const float a_max[2],
Named*
const& a_data) {
94 NAMED_RTREE_QUAL::Remove(a_min, a_max, a_data);
102 NAMED_RTREE_QUAL::RemoveAll();
116 return NAMED_RTREE_QUAL::Search(a_min, a_max, c);