blob: f4b304157fc270739f6b961430d93e9854729c40 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
#ifndef _CHART2_CLIPPING_HXX
#define _CHART2_CLIPPING_HXX
#include "DoubleRectangle.hxx"
#ifndef _COM_SUN_STAR_DRAWING_POLYPOLYGONSHAPE3D_HPP_
#include <com/sun/star/drawing/PolyPolygonShape3D.hpp>
#endif
//.............................................................................
namespace chart
{
//.............................................................................
//-----------------------------------------------------------------------------
/**
*/
class Clipping
{
/** This class uses the Liang-Biarsky parametric line-clipping algorithm as described in:
Computer Graphics: principles and practice, 2nd ed.,
James D. Foley et al.,
Section 3.12.4 on page 117.
*/
public:
/** @descr The intersection between an open polygon and a rectangle is
calculated and the resulting lines are placed into the poly-polygon aResult.
@param rPolygon The polygon is required to be open, ie. it's start and end point
have different coordinates and that it is continuous, ie. has no holes.
@param rRectangle The clipping area.
@param aResult The resulting lines that are the parts of the given polygon lying inside
the clipping area are stored into aResult whose prior content is deleted first.
*/
static void clipPolygonAtRectangle(
const ::com::sun::star::drawing::PolyPolygonShape3D& rPolygon
, const DoubleRectangle& rRectangle
, ::com::sun::star::drawing::PolyPolygonShape3D& aResult
, bool bSplitPiecesToDifferentPolygons = true );
};
//.............................................................................
} //namespace chart
//.............................................................................
#endif
|
