C# Класс CsPotrace.Potrace

Makes a Black and White Bitmap from the Data of a Binarymatrix. Value with 'true' returns a white Pixel such with 'false' a Black pixel.

Produces a binary Matrix with Dimensions b.Width+2 and b.Height +2, where the Border ( of width) in the Matrix is filled with 'true' -values. On this way we avoid a lot of boundsinequalities. For the threshold, we take the Maximum of (R,G,B ) of a Pixel at x,y. If this is less then the threshold the resultMatrix at x+1, y+1 is filled with false else with true.

It is the main function, which yields the curveinformations related to a given binary bitmap. It fills the ArrayList ListOfCurveArrays with curvepathes. Each of this pathes is an list of connecting curves. Example:

 Call first: ArrayList ListOfCurveArrays = new ArrayList(); potrace_trace(bm, ListOfCurveArrays); Paint the result: GraphicsPath gp = new GraphicsPath(); for (int i = 0; i < ListOfCurveArrays.Count; i++) { ArrayList CurveArray = (ArrayList)ListOfCurveArrays[i]; GraphicsPath Contour=null; GraphicsPath Hole = null; GraphicsPath Current=null; for (int j = 0; j < CurveArray.Count; j++) { if (j == 0) { Contour = new GraphicsPath(); Current = Contour; } else { Hole = new GraphicsPath(); Current = Hole; } Potrace.Curve[] Curves = (Curve[])CurveArray[j]; for (int k = 0; k < Curves.Length; k++) { if (Curves[k].Kind == Potrace.CurveKind.Bezier) Current.AddBezier((float)Curves[k].A.x, (float)Curves[k].A.y, (float)Curves[k].ControlPointA.x, (float)Curves[k].ControlPoint.y, (float)Curves[k].ControlPointB.x, (float)Curves[k].ControlPointB.y, (float)Curves[k].B.x, (float)Curves[k].B.y); else Current.AddLine((float)Curves[k].A.x, (float)Curves[k].A.y, (float)Curves[k].B.x, (float)Curves[k].B.y); } if (j > 0) Contour.AddPath(Hole, false); } gp.AddPath(Contour, false); } // any Graphic g Graphics g = CreateGraphics(); // Paint the fill g.FillPath(Brushes.Black, gp); // Paint the border g.DrawPath(Pens.Red,gp); 

Searches a x and a y such that source[x,y] = true and source[x+1,y] false. If this not exists, false will be returned else the result is true.

Searches a x and a y inside the Path P such that source[x,y] = true and source[x+1,y] false. If this not exists, false will be returned else the result is true.

Decompose the given bitmap into paths. Returns a linked list of Path objects with the fields len, pt, area filled

Preparation: fill in the sum* fields of a path (used for later rapid summing).

Compute a path in the binary matrix. Start path at the point (x0,x1), which must be an upper left corner of the path. Also compute the area enclosed by the path. Return a new path_t object, or NULL on error (note that a legitimate path cannot have length 0). We omit turnpolicies and sign