Reconstructing collections of arbitrary curves
Tobias Lenz · 2005
The presented alg rithm rec nstructs collections of arbitrary curves (open, closed, smooth, with corners, with or without intersections). The algorithm is very simple and short and follows a novel and simple greedy strategy. The corner and intersection points are not required to but allowed to be in the sample. The described method works for curves in any dimension d asymptotically in O (n2-1/d) time with involved data structures. Experiments show already a good performance with a very simple kd-tree structure.