------------------------------------------------------------------------- add a circular arc to the list of arcs

end-AngleSet

--------------------------------------------------------------------- Fits a circle to a given set of points. There must be at least 2 points The circ

------------------------------------------------------------------------------------ Computes the points making up a circle

--------------------------------------------------------------------------------- Given a point (x1, y1) and a line equation y=a+bx (invert=0) OR x=a+

also returns rotate angle theta

--------------------------------------------------------------------------- Given an ellipse equation, computes "noPoints" many consecutive points on

------------------------------------------------------------------------------- Computes the minimum distance between the end points of two lines

----------------------------------------------------------------------------------------- Computes the minimum line length using the NFA formula given

-------------------------------------------------------------- Given a circular arc, computes the start & end angles of the arc in radians

---------------------------------------------------------------------------------------------- After the validation of the edge segments, extracts the

------------------------------------------------------------------ Goes over the original line segments and combines collinear lines that belong to th

----------------------------------------------------------------------------------- Fits a line of the form y=a+bx (invert == 0) OR x=a+by (invert ==

--------------------------------------------------------------------------- Number of false alarms code as suggested by Desolneux, Moisan and Morel (D

----------------------------------------------------------------- Given a full segment of pixels, splits the chain to lines This code is used when we

---------------------------------------------------------------------------------- Resursive validation using half of the pixels as suggested by DMM a

----------------------------------------------------------------- Checks if the given line segments are collinear & joins them if they are In case of

----------------------------------------------------------------------------------- Uses the two end points (sx, sy)----(ex, ey) of the line segment a

----------------------------------------------------------------- Go over all circles & ellipses and validate them The idea here is to look at all pix

----------------------------------------------------------------------- Add a new arc to arcs

----------------------------------------------------------- Perform the Cholesky decomposition Return the lower triangular L such that L*L'=A

--------------------------------------------------------------------------- Given an ellipse equation, computes the length of the perimeter of the ell