Two-Dimensional Space - Wikipedia
Two-Dimensional Space - Wikipedia
Two-Dimensional Space - Wikipedia
space
In geometry
Coordinate systems …
In mathematics, analytic geometry (also
called Cartesian geometry) describes
every point in two-dimensional space by
means of two coordinates. Two
perpendicular coordinate axes are given
which cross each other at the origin. They
are usually labeled x and y. Relative to
these axes, the position of any point in
two-dimensional space is given by an
ordered pair of real numbers, each number
giving the distance of that point from the
origin measured along the given axis,
which is equal to the distance of that point
from the other axis.
Another widely used coordinate system is
the polar coordinate system, which
specifies a point in terms of its distance
from the origin and its angle relative to a
rightward reference ray.
Cartesian coordinate system
Polytopes …
In two dimensions, there are infinitely
many polytopes: the polygons. The first
few regular ones are shown below:
Convex …
Image
Image
Image
Degenerate (spherical) …
Image
Non-convex …
...n-
Name Pentagram Heptagrams Octagram Enneagrams Decagram
agrams
Image
Circle …
The hypersphere in 2
dimensions is a circle,
sometimes called a 1-sphere
(S1) because it is a one-
dimensional manifold. In a Euclidean
plane, it has the length 2πr and the area of
its interior is
Other shapes …
In linear algebra
Another mathematical way of viewing two-
dimensional space is found in linear
algebra, where the idea of independence is
crucial. The plane has two dimensions
because the length of a rectangle is
independent of its width. In the technical
language of linear algebra, the plane is
two-dimensional because every point in
the plane can be described by a linear
combination of two independent vectors.
which gives
the formula for the Euclidean length of the
vector.
In calculus
Gradient …
Let . Then
Green's theorem …
In topology
In topology, the plane is characterized as
being the unique contractible 2-manifold.
In graph theory
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.[8] Such a drawing is called a plane
graph or 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.
See also
Picture function
References
1. "Analytic geometry". Encyclopædia
Britannica (Encyclopædia Britannica
Online ed.). 2008.
2. Burton 2011, p. 374
3. Wessel's memoir was presented to the
Danish Academy in 1797; Argand's
paper was published in 1806.
(Whittaker & Watson, 1927, p. 9)
4. S. Lipschutz; M. Lipson (2009). Linear
Algebra (Schaum’s Outlines) (4th ed.).
McGraw Hill. ISBN 978-0-07-154352-1.
5. M.R. Spiegel; S. Lipschutz; D. Spellman
(2009). Vector Analysis (Schaum’s
Outlines) (2nd ed.). McGraw Hill.
ISBN 978-0-07-161545-7.
. Mathematical methods for physics
and engineering, K.F. Riley, M.P.
Hobson, S.J. Bence, Cambridge
University Press, 2010, ISBN 978-0-
521-86153-3
7. Vector Analysis (2nd Edition), M.R.
Spiegel, S. Lipschutz, D. Spellman,
Schaum’s Outlines, McGraw Hill (USA),
2009, ISBN 978-0-07-161545-7
. Trudeau, Richard J. (1993).
Introduction to Graph Theory
(Corrected, enlarged republication.
ed.). New York: Dover Pub. p. 64.
ISBN 978-0-486-67870-2. Retrieved
8 August 2012. "Thus a planar graph,
when drawn on a flat surface, either
has no edge-crossings or can be
redrawn without them."
Retrieved from
"https://en.wikipedia.org/w/index.php?title=Two-
dimensional_space&oldid=977025390"