Concepts inAnimation of curve constrained drawings of planar graphs
Planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e. , it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. A planar graph already drawn in the plane without edge intersections is called a plane graph or planar embedding of the graph.
more from Wikipedia
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
Line segment
In geometry, a line segment is a part of a line that is bounded by two end points, and contains every point on the line between its end points. Examples of line segments include the sides of a triangle or square. More generally, when the end points are both vertices of a polygon, the line segment is either an edge (of that polygon) if they are adjacent vertices, or otherwise a diagonal. When the end points both lie on a curve such as a circle, a line segment is called a chord (of that curve).
more from Wikipedia
Animation
The bouncing ball animation (below) consists of these six frames. This animation moves at 10 frames per second. Animation is the rapid display of a sequence of images of 2-D or 3-D artwork or model positions to create an illusion of movement. The effect is an optical illusion of motion due to the phenomenon of persistence of vision, and can be created and demonstrated in several ways.
more from Wikipedia
Vertex (graph theory)
In graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
more from Wikipedia