Concepts inCurvature-bounded traversals of narrow corridors
Plane (geometry)
In mathematics, a plane is a flat, two-dimensional surface. A plane is the two dimensional analogue of a point (zero-dimensions), a line (one-dimension) and a space (three-dimensions). Planes can arise as subspaces of some higher dimensional space, as with the walls of a room, or they may enjoy an independent existence in their own right, as in the setting of Euclidean geometry.
more from Wikipedia
Curvature
In mathematics, curvature refers to any of a number of loosely related concepts in different areas of geometry. Intuitively, curvature is the amount by which a geometric object deviates from being flat, or straight in the case of a line, but this is defined in different ways depending on the context.
more from Wikipedia
Polygon
In geometry a polygon is a flat shape consisting of straight lines that are joined to form a closed chain or circuit. A polygon is traditionally a plane figure that is bounded by a closed path, composed of a finite sequence of straight line segments (i.e. , by a closed polygonal chain). These segments are called its edges or sides, and the points where two edges meet are the polygon's vertices or corners. An n-gon is a polygon with n sides.
more from Wikipedia
Domain of a function
In mathematics, the domain of definition or simply the domain of a function is the set of "input" or argument values for which the function is defined. That is, the function provides an "output" or value for each member of the domain. For instance, the domain of cosine is the set of all real numbers, while the domain of the square root consists only of numbers greater than or equal to 0 (ignoring complex numbers in both cases).
more from Wikipedia
Tree traversal
In computer science, tree traversal refers to the process of visiting (examining and/or updating) each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.
more from Wikipedia