bool CSG_PRQuadTree::Get_Nearest_Point(double x, double y, TSG_Point &Point, double &Value, double &Distance) const
{
CSG_PRQuadTree_Leaf *pLeaf = _Get_Nearest_Point(m_pRoot, x, y, Distance = -1);
if( pLeaf )
{
Point.x = pLeaf->Get_X();
Point.y = pLeaf->Get_Y();
Value = pLeaf->Get_Z();
return( true );
}
return( false );
}
//---------------------------------------------------------
size_t CSG_PRQuadTree::Get_Nearest_Points(CSG_Points_Z &Points, double x, double y, size_t maxPoints, double Radius, int iQuadrant) const
{
CSG_Array Selection;
_Select_Nearest_Points(Selection, x, y, maxPoints, Radius, iQuadrant);
Points.Clear();
for(size_t i=0; i<Selection.Get_Size(); i++)
{
CSG_PRQuadTree_Leaf *pLeaf = _Get_Selected(Selection, i)->pLeaf;
Points.Add(pLeaf->Get_X(), pLeaf->Get_Y(), pLeaf->Get_Z());
}
return( Points.Get_Count() );
}
//---------------------------------------------------------
void CSG_PRQuadTree::_Select_Nearest_Points(CSG_Array &Selection, CSG_PRQuadTree_Item *pItem, double x, double y, double &Distance, double Radius, size_t maxPoints, int iQuadrant) const
{
//-----------------------------------------------------
if( pItem->is_Leaf() )
{
CSG_PRQuadTree_Leaf *pLeaf = (CSG_PRQuadTree_Leaf *)pItem;
if( _Quadrant_Contains(x, y, iQuadrant, pLeaf->Get_Point()) == false )
{
return;
}
double d = SG_Get_Distance(x, y, pLeaf->Get_X(), pLeaf->Get_Y(), m_bPolar);
if( Radius > 0.0 && Radius < d )
{
return;
}
//-------------------------------------------------
if( Selection.Get_Size() < maxPoints )
{
if( Distance < d )
{
Distance = d;
}
_Add_Selected(Selection, pLeaf, d);
}
else if( d < Distance )
{
size_t i;
for(i=0; i<Selection.Get_Size(); i++)
{
if( Distance <= _Get_Selected(Selection, i)->Distance )
{
_Set_Selected(Selection, i, pLeaf, d);
break;
}
}
for(i=0, Distance=d; i<maxPoints; i++)
{
if( Distance < _Get_Selected(Selection, i)->Distance )
{
Distance = _Get_Selected(Selection, i)->Distance;
}
}
}
}
//-----------------------------------------------------
else // if( pItem->is_Node() )
{
int i;
CSG_PRQuadTree_Item *pChild;
for(i=0; i<4; i++)
{
if( (pChild = ((CSG_PRQuadTree_Node *)pItem)->Get_Child(i)) != NULL && pChild->Contains(x, y) == true )
{
_Select_Nearest_Points(Selection, pChild, x, y, Distance, Radius, maxPoints, iQuadrant);
}
}
for(i=0; i<4; i++)
{
if( (pChild = ((CSG_PRQuadTree_Node *)pItem)->Get_Child(i)) != NULL && pChild->Contains(x, y) == false )
{
if( _Radius_Intersects(x, y, Radius, iQuadrant, pChild) )
{
if( Get_Selected_Count() < maxPoints
|| ( Distance > (x < pChild->Get_xCenter() ? pChild->Get_xMin() - x : x - pChild->Get_xMax())
&& Distance > (y < pChild->Get_yCenter() ? pChild->Get_yMin() - y : y - pChild->Get_yMax()) ) )
{
_Select_Nearest_Points(Selection, pChild, x, y, Distance, Radius, maxPoints, iQuadrant);
}
}
}
}
}
}
//---------------------------------------------------------
bool CSG_PRQuadTree_Node::Add_Point(double x, double y, double z)
{
if( Contains(x, y) )
{
if( has_Statistics() )
{
Get_X()->Add_Value(x);
Get_Y()->Add_Value(y);
Get_Z()->Add_Value(z);
}
int i = y < m_yCenter ? (x < m_xCenter ? 0 : 3) : (x < m_xCenter ? 1 : 2);
//-------------------------------------------------
if( m_pChildren[i] == NULL )
{
double Size = 0.5 * m_Size;
switch( i )
{
case 0: m_pChildren[i] = new CSG_PRQuadTree_Leaf(m_xCenter - Size, m_yCenter - Size, Size, x, y, z); break;
case 1: m_pChildren[i] = new CSG_PRQuadTree_Leaf(m_xCenter - Size, m_yCenter + Size, Size, x, y, z); break;
case 2: m_pChildren[i] = new CSG_PRQuadTree_Leaf(m_xCenter + Size, m_yCenter + Size, Size, x, y, z); break;
case 3: m_pChildren[i] = new CSG_PRQuadTree_Leaf(m_xCenter + Size, m_yCenter - Size, Size, x, y, z); break;
}
return( true );
}
//-----------------------------------------------------
if( m_pChildren[i]->is_Leaf() )
{
CSG_PRQuadTree_Leaf *pLeaf = m_pChildren[i]->asLeaf();
if( x != pLeaf->Get_X() || y != pLeaf->Get_Y() )
{
if( has_Statistics() )
{
m_pChildren[i] = new CSG_PRQuadTree_Node_Statistics (pLeaf);
}
else
{
m_pChildren[i] = new CSG_PRQuadTree_Node (pLeaf);
}
((CSG_PRQuadTree_Node *)m_pChildren[i])->Add_Point(x, y, z);
}
else
{
if( !pLeaf->has_Statistics() )
{
m_pChildren[i] = new CSG_PRQuadTree_Leaf_List(pLeaf->m_xCenter, pLeaf->m_yCenter, pLeaf->m_Size, x, y, pLeaf->Get_Z());
delete(pLeaf);
}
((CSG_PRQuadTree_Leaf_List *)m_pChildren[i])->Add_Value(z);
}
return( true );
}
//-------------------------------------------------
// if( m_pChildren[i]->is_Node() )
{
return( ((CSG_PRQuadTree_Node *)m_pChildren[i])->Add_Point(x, y, z) );
}
}
return( false );
}
