Two-dimensional Graph
A two-dimensional graph may refer to * The graph of a function of one variable * A planar graph * A diagram A diagram is a symbolic Depiction, representation of information using Visualization (graphics), visualization techniques. Diagrams have been used since prehistoric times on Cave painting, walls of caves, but became more prevalent during the Age o ...

Graph Of A Function
In mathematics, the graph of a function f is the set of ordered pairs (x, y), where f(x) = y. In the common case where x and f(x) are real numbers, these pairs are Cartesian coordinates of points in a plane (geometry), plane and often form a Plane curve, curve. The graphical representation of the graph of a Function (mathematics), function is also known as a ''Plot (graphics), plot''. In the case of Bivariate function, functions of two variables – that is, functions whose Domain of a function, domain consists of pairs (x, y) –, the graph usually refers to the set of ordered triples (x, y, z) where f(x,y) = z. This is a subset of three-dimensional space; for a continuous real-valued function of two real variables, its graph forms a Surface (mathematics), surface, which can be visualized as a ''surface plot (graphics), surface plot''. In science, engineering, technology, finance, and other areas, graphs are tools used for many purposes. In the simplest case one variable is p ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Planar Graph
In graph theory, a planar graph is a graph (discrete mathematics), graph that can be graph embedding, embedded in the plane (geometry), 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. Such a drawing is called a plane graph, or a planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with addit ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]