本文整理汇总了C++中QuadTree::GetLocation方法的典型用法代码示例。如果您正苦于以下问题：C++ QuadTree::GetLocation方法的具体用法？C++ QuadTree::GetLocation怎么用？C++ QuadTree::GetLocation使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类QuadTree的用法示例。
在下文中一共展示了QuadTree::GetLocation方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: if
IntersectResult PolygonContainer<TYPE>::QueryPolygonSegmentIntersect(Segment* s)
{
queue<QuadTree*> trees;
trees.push(this);
int lx = s->GetBoundingBox()->GetMinX();
int ly = s->GetBoundingBox()->GetMinY();
int hx = s->GetBoundingBox()->GetMaxX();
int hy = s->GetBoundingBox()->GetMaxY();
IntersectResult ret = IR_SEPERATE;
while(!trees.empty())
{
QuadTree* tree = trees.front();
trees.pop();
if(tree == 0) continue;
QuadObjects objects = tree->GetObjects();
QuadObjectIterator it = objects.begin();
for(;it != objects.end();it++)
{
QuadObject* quad = *it;
TYPE* poly = (TYPE*)quad;
IntersectResult ret1 = PolygonSegmentIntersect(s, poly);
if (ret1 == IR_WITHIN || ret1 == IR_INTERSECT) return ret1;
ret = ret1;
}
Geometry::TREE_LOCATION location = tree->GetLocation(lx, ly, hx, hy);
if(location == Geometry::TL_CHILD0)
{
trees.push(tree->SubNode(0));
}
else if(location == Geometry::TL_CHILD1)
{
trees.push(tree->SubNode(1));
}
else if(location == Geometry::TL_CHILD2)
{
trees.push(tree->SubNode(2));
}
else if(location == Geometry::TL_CHILD3)
{
trees.push(tree->SubNode(3));
}
else
{
trees.push(tree->SubNode(0));
trees.push(tree->SubNode(1));
trees.push(tree->SubNode(2));
trees.push(tree->SubNode(3));
}
}
return ret;
}