This folder contains the implementation of the algorithm as described in the paper. The starting point is at file ‘util.m’. The run the completion one must first create the data structures that hold curves for quick access (the code to do so is in ‘util.m’), however, this takes quite some time.

The main functions are:
completeCurve.m - calculate curve completion given a pair of inducers.
getArcLength.m - calculate arclength between two points in a curve (a set of points).
getCurveEquiPoints.m - finds a set of n points on a curve with equal arclengths between subsequent points.
getNearFrags.m - get the relevant curve fragments from which to calculate the mean curve.
 
