mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

#i106127# perf: make self-intersection-test of bezier curve much cheaper

Browse Source
This commit is contained in:
hdu
2009-10-21 15:43:13 +02:00
parent b40fbbe280
commit c94382c180
1 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
basegfx/source/polygon/b2dpolygoncutandtouch.cxx
View File

@@ -497,6 +497,11 @@ namespace basegfx
const B2DCubicBezier& rCubicA, const B2DCubicBezier& rCubicA,
sal_uInt32 nInd, temporaryPointVector& rTempPoints) sal_uInt32 nInd, temporaryPointVector& rTempPoints)
{ {
double fDummy;
const bool bHasAnyExtremum = rCubicA.getMinimumExtremumPosition( fDummy );
if( !bHasAnyExtremum )
return;
// find all self-intersections on the given bezier segment. Add an entry to the tempPoints // find all self-intersections on the given bezier segment. Add an entry to the tempPoints
// for each self intersection point with the cut value describing the relative position on given // for each self intersection point with the cut value describing the relative position on given
// bezier segment. // bezier segment.