BevelHelpers Class Reference

#include <ppbevel.h>

Inheritance diagram for BevelHelpers:

List of all members.

Static Public Member Functions
static void	ShrinkPath (Path *pSrcPath, double amountX, double amountY, Path *pRetnPath, BOOL bTest=TRUE)
	Shrinks the path very slightly so that antialiasing doesn't bleed out of the bevel.
static BOOL	IsPathToBeReversed (Path *pPath)
	Indicates that the path is around the wrong way for bevelling i.e. the normals will be facing outwards, not inwards Notes: The path must have no sub-paths.
static void	EliminateMultiplePoints (Path *pPath)
	Eliminates multiple points in the path Path must be flat !

---

Detailed Description

Definition at line 177 of file ppbevel.h.

---

Member Function Documentation

void BevelHelpers::EliminateMultiplePoints (  Path *  pPath  )  [static]

Eliminates multiple points in the path Path must be flat ! Author: David_McClarnon (Xara Group Ltd) <camelotdev@xara.com> Date: 20/1/99 See also: - Definition at line 642 of file ppbevel.cpp. { Path NewPath; NewPath.Initialise(); // flatten the path pPath->Flatten(200, &NewPath); pPath->CloneFrom(NewPath); pPath->IsFilled = TRUE; pPath->IsStroked = FALSE; NewPath.ClearPath(); NewPath.IsFilled = TRUE; NewPath.IsStroked = FALSE; DocCoord dc1(0,0); DocCoord dc2; INT32 StartIndex = 0; for (INT32 i = 0 ; i < pPath->GetNumCoords(); i++) { dc2 = pPath->GetCoordArray()[i]; // ensure that dc1 is different to dc2 on first index if (i == 0) { dc1.x = dc2.x - 1000; } if (dc2.x != dc1.x || dc2.y != dc1.y || pPath->GetVerbArray()[i] == PT_MOVETO) { if (pPath->GetVerbArray()[i] == PT_MOVETO) { /* if (i > 0) { // make sure we close the path if (NewPath.GetCoordArray()[i - 1].x != NewPath.GetCoordArray()[StartIndex].x || NewPath.GetCoordArray()[i - 1].y != NewPath.GetCoordArray()[StartIndex].y) { NewPath.AddLineTo(NewPath.GetCoordArray()[StartIndex]); } } */ NewPath.AddMoveTo(dc2); StartIndex = i; } else { NewPath.AddLineTo(dc2); } } dc1 = dc2; } // make sure we close the path /* if (NewPath.GetCoordArray()[i - 1].x != NewPath.GetCoordArray()[StartIndex].x || NewPath.GetCoordArray()[i - 1].y != NewPath.GetCoordArray()[StartIndex].y) { NewPath.AddLineTo(NewPath.GetCoordArray()[StartIndex]); } */ pPath->ClearPath(); pPath->CloneFrom(NewPath); }

BOOL BevelHelpers::IsPathToBeReversed (  Path *  pPath  )  [static]

Indicates that the path is around the wrong way for bevelling i.e. the normals will be facing outwards, not inwards Notes: The path must have no sub-paths. Author: David_McClarnon (Xara Group Ltd) <camelotdev@xara.com> Date: 29/10/98 See also: - Definition at line 581 of file ppbevel.cpp. { NormCoord ncBefore; NormCoord ncAfter; NormCoord ncBefore90; double TotalDot = 0; double dot1 = 0; double dot2 = 0; DocRect Bounds = pPath->GetBoundingRect(); DocCoord Centre ; Centre.x = Bounds.lo.x + (Bounds.Width() / 2); Centre.y = Bounds.lo.y + (Bounds.Height() / 2); UINT32 Count = 0; for (INT32 i = 0; i < pPath->GetNumCoords()-1; i++) { if (i > 0 && pPath->GetVerbArray()[i] == PT_MOVETO) break; Count ++; // get the points before & after ncBefore.x = pPath->GetCoordArray()[i].x - Centre.x; ncBefore.y = pPath->GetCoordArray()[i].y - Centre.y; ncAfter.x = pPath->GetCoordArray()[i+1].x - Centre.x; ncAfter.y = pPath->GetCoordArray()[i+1].y - Centre.y; ncBefore.Normalise(); ncAfter.Normalise(); ncBefore90.y = -ncBefore.x; ncBefore90.x = ncBefore.y; dot1 = ncBefore90.x * ncAfter.x + ncBefore90.y * ncAfter.y; dot2 = ncBefore.x * ncAfter.x + ncBefore.y * ncAfter.y; TotalDot += dot1; } TotalDot /= (double)Count; TRACEUSER( "DavidM", _T("Total %f\n"), TotalDot); return (TotalDot < -0.05); }

void BevelHelpers::ShrinkPath (  Path *  pSrcPath, double  amountX, double  amountY, Path *  pRetnPath, BOOL  bTest = TRUE )  [static]

Shrinks the path very slightly so that antialiasing doesn't bleed out of the bevel. Author: David_McClarnon (Xara Group Ltd) <camelotdev@xara.com> Date: 29/10/98 See also: - Definition at line 262 of file ppbevel.cpp. { if (!pSrcPath || !pRetnPath) return; if (pSrcPath->GetNumCoords() < 3) { pRetnPath->CloneFrom(*pSrcPath); return; } if (amountX == 0 || amountY == 0) return; pRetnPath->ClearPath(); pRetnPath->CloneFrom(*pSrcPath); DocCoord dcBefore; DocCoord dcThis; DocCoord dcAfter; DocCoord dcTest; DocRect testRect; DocRect thisRect; NormCoord ncBefore; NormCoord ncAfter; NormCoord ncAverage; double dt = 0; // double dot = 0; INT32 IStart = 0; INT32 IEnd = 0; double BeforeLen = 0; double AfterLen = 0; double LenAverage = 0; BOOL bOK = FALSE; // first, calculate the normal list NormCoord *pNormList = new NormCoord[pSrcPath->GetNumCoords()]; for (INT32 i = 0 ; i < pSrcPath->GetNumCoords(); i++) { // get the points before & after IStart = i - 1; IEnd = i + 1; if (i == pSrcPath->GetNumCoords() - 1) { IEnd = i; pSrcPath->FindStartOfSubPath(&IEnd); IEnd ++; } else if (pSrcPath->GetVerbArray()[i] == PT_MOVETO) { // find the end of the sub-path IStart = i; pSrcPath->FindEndElOfSubPath(&IStart); IStart -= 1; } else if (pSrcPath->GetVerbArray()[i+1] == PT_MOVETO) { IEnd = i; pSrcPath->FindStartOfSubPath(&IEnd); IEnd ++; } dcBefore = pSrcPath->GetCoordArray()[IStart]; dcThis = pSrcPath->GetCoordArray()[i]; dcAfter = pSrcPath->GetCoordArray()[IEnd]; ncBefore.x = dcThis.x - dcBefore.x; ncBefore.y = dcThis.y - dcBefore.y; BeforeLen = 1/ncBefore.GetLength(); if (BeforeLen > 0) { ncBefore.x *= BeforeLen; ncBefore.y *= BeforeLen; } ncAfter.x = dcAfter.x - dcThis.x; ncAfter.y = dcAfter.y - dcThis.y; AfterLen = 1/ncAfter.GetLength(); if (AfterLen > 0) { ncAfter.x *= AfterLen; ncAfter.y *= AfterLen; } ncAverage.x = ncBefore.x + ncAfter.x; ncAverage.y = ncBefore.y + ncAfter.y; LenAverage = 1/ncAverage.GetLength(); // do the normal if (LenAverage > 0) { ncAverage.x *= LenAverage; ncAverage.y *= LenAverage; // rotate by 90 degrees dt = ncAverage.x; ncAverage.x = -ncAverage.y; ncAverage.y = dt; pNormList[i] = ncAverage; } } INT32 AbsAmountX = abs((INT32)(amountX)); INT32 AbsAmountY = abs((INT32)(amountY)); INT32 NextIndex = 0; DocCoord intersection; double p = 0; double q = 0; BOOL bDoTest = FALSE; // now, run through the list again calculating bounding rects for (INT32 i = 0 ; i < pSrcPath->GetNumCoords(); i++) { dcThis = pSrcPath->GetCoordArray()[i]; // only do this on single sub-paths (quicker !) /* if (pSrcPath->GetVerbArray()[i] == PT_MOVETO) { IStart = i; IEnd = i; pSrcPath->FindEndElOfSubPath(&IEnd); } */ IStart = 0; IEnd = pSrcPath->GetNumCoords(); // is sub path in list ? bOK = TRUE; IStart = 0; IEnd = pSrcPath->GetNumCoords(); thisRect.lo.x = dcThis.x - AbsAmountX; thisRect.lo.y = dcThis.y - AbsAmountY; thisRect.hi.x = dcThis.x + AbsAmountX; thisRect.hi.y = dcThis.y + AbsAmountY; for (INT32 j = IStart; j <= IEnd && bOK; j++) { // get the line segment to test dcTest = pSrcPath->GetCoordArray()[j]; bDoTest = TRUE; if (i == IStart) { if (j == IEnd || j == i || j == i+1) { bDoTest = FALSE; } } else if (i == IEnd) { if (j == IEnd - 1 || j == i || j == IStart) { bDoTest = FALSE; } } else if (j == i - 1 || j == i || j == i+1) { bDoTest = FALSE; } if (bDoTest) { NextIndex = j + 1; if (NextIndex == IEnd) { NextIndex = IStart; } dcAfter = pSrcPath->GetCoordArray()[NextIndex]; // do the bounding rect if (dcTest.x < dcAfter.x) { testRect.lo.x = dcTest.x; testRect.hi.x = dcAfter.x; } else { testRect.lo.x = dcAfter.x; testRect.hi.x = dcTest.x; } if (dcTest.y < dcAfter.y) { testRect.lo.y = dcTest.y; testRect.hi.y = dcAfter.y; } else { testRect.lo.y = dcAfter.y; testRect.hi.y = dcTest.y; } if (testRect.IsIntersectedWith(thisRect)) { // check if when we move the point the point changes sides from // one side of the line segment to the other ncAverage.x = dcTest.x - dcAfter.x; ncAverage.y = dcTest.y - dcAfter.y; if (CCreateBevelTrapezoids::CalculateIntersection(&dcThis, &(pNormList[i]), &dcAfter, &ncAverage, &intersection, &p, &q)) { if (intersection.x > testRect.lo.x && intersection.x < testRect.hi.x && intersection.y > testRect.lo.y && intersection.y < testRect.hi.y) { // get the length of the line ncAverage.x = dcThis.x - intersection.x; ncAverage.y = dcThis.y - intersection.y; q = ncAverage.GetLength(); if (q > 0) { if (q < fabs(amountX*2)) { bOK = FALSE; } } } } } } } if (bOK) { dcThis.x = (INT32)((((double)dcThis.x) - (pNormList[i].x * amountX))); dcThis.y = (INT32)((((double)dcThis.y) - (pNormList[i].y * amountY))); pRetnPath->GetCoordArray()[i] = dcThis; } } delete [] pNormList; pNormList = NULL; /* Path StrokedPath; StrokedPath.Initialise(); pSrcPath->StrokePathToPath((INT32)(amountX*2), LineCapButt, MitreJoin, NULL, &StrokedPath, BEVEL_FLATNESS/5, TRUE); // need to flatten this ProcessFlatten Flatten(BEVEL_FLATNESS/5); Path FlatPath; FlatPath.Initialise(); pRetnPath->ClearPath(FALSE); pRetnPath->Initialise(); ProcessFlags pf(TRUE, FALSE, FALSE); Flatten.FlattenPath(pf, &StrokedPath, &FlatPath); if (!bAdd) { FlatPath.ClipPathToPath(pSrcPath, pRetnPath, 1 | CLIPPING_SOURCE_WINDING, 0, BEVEL_FLATNESS/5, BEVEL_FLATNESS/5); } else { FlatPath.ClipPathToPath(pSrcPath, pRetnPath, 7 | CLIPPING_SOURCE_WINDING, 0, BEVEL_FLATNESS/5, BEVEL_FLATNESS/5); } */ pRetnPath->IsFilled = TRUE; pRetnPath->IsStroked = FALSE; }

---

The documentation for this class was generated from the following files:

• Kernel/ppbevel.h (r1785/r751)
• Kernel/ppbevel.cpp (r1785/r1282)

---