GEOS
3.8.0dev

Speedoptimized clipping of a Geometry with a rectangle. More...
#include <RectangleIntersection.h>
Static Public Member Functions  
static std::unique_ptr < geom::Geometry >  clip (const geom::Geometry &geom, const Rectangle &rect) 
Clip geometry with a rectangle. More...  
static std::unique_ptr < geom::Geometry >  clipBoundary (const geom::Geometry &geom, const Rectangle &rect) 
Clip boundary of a geometry with a rectangle. More...  
Speedoptimized clipping of a Geometry with a rectangle.
Two different methods are provided. The first performs normal clipping, the second clips the boundaries of polygons, not the polygons themselves. In the first case a polygon will remain a polygon or is completely cut out. In the latter case polygons will be converted to polylines if any vertex is outside the clipping rectangle, or will be cut out completely.
The algorithm works best when the number of intersections is very low. For example, if the geometry is completely to the left of the clipping rectangle, only the xcoordinate of the geometry is ever tested and is only compared with the xcoordinate of the left edge of the rectangle. Hence clipping may be faster than calculating the envelope of the geometry for trivial overlap tests.
The input geometry must be valid. In particular all LinearRings must be properly closed, or the algorithm may not terminate.

static 

static 