Concepts inReconstructing collections of arbitrary curves
Curve
In mathematics, a curve (also called a curved line in older texts) is, generally speaking, an object similar to a line but which is not required to be straight. This entails that a line is a special case of curve, namely a curve with null curvature. Often curves in two-dimensional or three-dimensional (space curves) Euclidean space are of interest.
more from Wikipedia
K-d tree
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key. k-d trees are a special case of binary space partitioning trees.
more from Wikipedia
Closed manifold
In mathematics, a closed manifold is a type of topological space, namely a compact manifold without boundary. In contexts where no boundary is possible, any compact manifold is a closed manifold. The simplest example is a circle, which is a compact one-dimensional manifold. Other examples of closed manifolds are the torus and the Klein bottle. As a counterexample, the real line is not a closed manifold because it is not compact.
more from Wikipedia
Greedy algorithm
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. On some problems, a greedy strategy need not produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution.
more from Wikipedia
Open set
In topology, a set is called an open set if it is a neighborhood of every point . When dealing with metric spaces, this can be intuitively interpreted as saying that every can be "moved" some non-zero distance, in any direction, and it will still lie within . The notion of an open set provides a fundamental way to speak of nearness of points in a topological space, without explicitly having a concept of distance defined.
more from Wikipedia
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
more from Wikipedia