//=================================================================================
bool BoundedPointListNode::FindTightestBounds( Bounds& tightestBounds ) const
{
	if( pointList->size() == 0 )
		return false;

	List::const_iterator iter = pointList->begin();
	tightestBounds.min = *iter;
	tightestBounds.max = *iter++;
	while( iter != pointList->end() )
		tightestBounds.MinimallyExpandToIncludePoint( *iter++ );

	return true;
}