Recycle a sequence block: */

Return pointer to blob by its unique ID: */

===================================================

\ Fast cube root by Ken Turkowski (http://www.worldserver.com/turk/computergraphics/papers.html) \* ********************************************

convert array (CvMat or IplImage) to IplImage

Initializes line iterator. Returns number of points on the line or negative number if error. */

Returns pointer to specified element of 3d array

universal functions */

Deallocates array's data

Creates CvMatND and underlying data

Calculate index of a sequence element: */

Add new element to the set: */

Sets a value range for every histogram bin

-----------------------------------------------------------------------*/ Compute projected infinite point for second image if first image point is kn

-----------------------------------------------------------------------*/ Compute projected infinite point for second image if first image point is kn

Convert function for stereo warping */

||I(x) - J(x')|| = min(CUTOFF, min( max( max(minJ(x') - I(x), 0), max(I(x) - maxJ(x'), 0)), max( max(minI(x) - J(x'), 0), max(J(x') - maxI(x), 0)))**2

filling convex polygon. v - array of vertices, ntps - number of points */

y[0:m,0:n] += diag(a[0:1,0:m]) * x[0:m,0:n] */

---------------------------------------------------------------------------------------*/ Project point to line */

distance between 2 vectors */

---------------------------------------------------------------------------------------*/ Test for point in sector */ Return 0 - point not i

run to leaf; linear search for p; if found, remove paths to empty leaves on unwind