//---------------------------------------------------------
bool Cut_Shapes(CSG_Rect Extent, int Method, CSG_Shapes *pShapes, CSG_Shapes *pCut)
{
if( pCut && pShapes && pShapes->is_Valid() && Extent.Intersects(pShapes->Get_Extent()) )
{
pCut->Create(
pShapes->Get_Type(),
CSG_String::Format(SG_T("%s [%s]"), pShapes->Get_Name(), _TL("Cut")),
pShapes
);
for(int iShape=0; iShape<pShapes->Get_Count() && SG_UI_Process_Set_Progress(iShape, pShapes->Get_Count()); iShape++)
{
bool bAdd;
CSG_Shape *pShape = pShapes->Get_Shape(iShape);
if( Method == 2 ) // center
{
bAdd = pShapes->Get_Type() == SHAPE_TYPE_Polygon
? Extent.Contains(((CSG_Shape_Polygon *)pShape)->Get_Centroid())
: Extent.Contains(pShape->Get_Extent().Get_Center());
}
else // completely contained, intersects
{
switch( pShape->Intersects(Extent) )
{
case INTERSECTION_Identical:
case INTERSECTION_Contained:
bAdd = true;
break;
case INTERSECTION_Overlaps:
case INTERSECTION_Contains:
bAdd = Method == 1;
break;
default:
bAdd = false;
break;
}
}
if( bAdd )
{
pCut->Add_Shape(pShape);
}
}
return( pCut->Get_Count() > 0 );
}
return( false );
}
//---------------------------------------------------------
bool CGCS_Graticule::Get_Coordinate(const CSG_Rect &Extent, CSG_Shapes *pCoordinates, CSG_Shape *pLine, int Axis)
{
if( !pCoordinates || !Extent.Intersects(pLine->Get_Extent()) || pLine->Get_Point_Count(0) < 2 )
{
return( false );
}
TSG_Point A[2], B[2], C;
switch( Axis )
{
case AXIS_LEFT : A[0].x = A[1].x = Extent.Get_XMin(); A[0].y = Extent.Get_YMin(); A[1].y = Extent.Get_YMax(); break;
case AXIS_RIGHT : A[0].x = A[1].x = Extent.Get_XMax(); A[0].y = Extent.Get_YMin(); A[1].y = Extent.Get_YMax(); break;
case AXIS_BOTTOM: A[0].y = A[1].y = Extent.Get_YMin(); A[0].x = Extent.Get_XMin(); A[1].x = Extent.Get_XMax(); break;
case AXIS_TOP : A[0].y = A[1].y = Extent.Get_YMax(); A[0].x = Extent.Get_XMin(); A[1].x = Extent.Get_XMax(); break;
default:
return( false );
}
//-----------------------------------------------------
B[1] = pLine->Get_Point(0);
for(int i=1; i<pLine->Get_Point_Count(); i++)
{
B[0] = B[1];
B[1] = pLine->Get_Point(i);
if( SG_Get_Crossing(C, A[0], A[1], B[0], B[1], true) )
{
CSG_Shape *pPoint = pCoordinates->Add_Shape();
pPoint->Add_Point(C);
pPoint->Set_Value(0, CSG_String(pLine->asString(0)) + (Axis == AXIS_LEFT || Axis == AXIS_BOTTOM ? "_MIN" : "_MAX"));
pPoint->Set_Value(1, pLine->asString(1));
return( true );
}
}
//-----------------------------------------------------
switch( Axis )
{
case AXIS_LEFT : C = pLine->Get_Point(0, 0, true ); break;
case AXIS_RIGHT : C = pLine->Get_Point(0, 0, false); break;
case AXIS_BOTTOM: C = pLine->Get_Point(0, 0, true ); break;
case AXIS_TOP : C = pLine->Get_Point(0, 0, false); break;
}
if( Extent.Contains(C) )
{
CSG_Shape *pPoint = pCoordinates->Add_Shape();
pPoint->Add_Point(C);
pPoint->Set_Value(0, CSG_String(pLine->asString(0)) + (Axis == AXIS_LEFT || Axis == AXIS_BOTTOM ? "_MIN" : "_MAX"));
pPoint->Set_Value(1, pLine->asString(1));
return( true );
}
//-----------------------------------------------------
return( false );
}
