Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Edge (geometry)

From Wikipedia, the free encyclopedia
Line segment joining two adjacent vertices in a polygon or polytope
Not to be confused withEdge (graph theory).

Three edges AB, BC, and CA, each between twovertices of atriangle
A polygon is bounded by edges; thissquare has 4 edges.
Every edge is shared by twofaces in apolyhedron, like thiscube.
Every edge is shared by three or more faces in a4-polytope, as seen in this projection of atesseract.

Ingeometry, anedge is a particular type ofline segment joining twovertices in apolygon,polyhedron, or higher-dimensionalpolytope.[1] In a polygon, an edge is a line segment on the boundary,[2] and is often called apolygon side. In a polyhedron or more generally a polytope, an edge is a line segment where twofaces (or polyhedron sides) meet.[3] A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called adiagonal.

Anedge may also be an infiniteline separating twohalf-planes.[4]Thesides of aplane angle are semi-infinitehalf-lines (or rays).[5]

Relation to edges in graphs

[edit]

Ingraph theory, anedge is an abstract object connecting twograph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment.However, any polyhedron can be represented by itsskeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges.[6] Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized bySteinitz's theorem as being exactly the3-vertex-connectedplanar graphs.[7]

Number of edges in a polyhedron

[edit]

Anyconvex polyhedron's surface hasEuler characteristic

VE+F=2,{\displaystyle V-E+F=2,}

whereV is the number ofvertices,E is the number of edges, andF is the number offaces. This equation is known asEuler's polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces. For example, acube has 8 vertices and 6 faces, and hence 12 edges.

Incidences with other faces

[edit]

In a polygon, two edges meet at eachvertex; more generally, byBalinski's theorem, at leastd edges meet at every vertex of ad-dimensional convex polytope.[8]Similarly, in a polyhedron, exactly two two-dimensional faces meet at every edge,[9] while in higher dimensional polytopes three or more two-dimensional faces meet at every edge.

Alternative terminology

[edit]

In the theory of high-dimensionalconvex polytopes, afacet orside of ad-dimensionalpolytope is one of its (d − 1)-dimensional features, aridge is a (d − 2)-dimensional feature, and apeak is a (d − 3)-dimensional feature. Thus, the edges of a polygon are its facets, the edges of a 3-dimensionalconvex polyhedron are its ridges, and the edges of a4-dimensional polytope are its peaks.[10]

See also

[edit]

References

[edit]
  1. ^Ziegler, Günter M. (1995),Lectures on Polytopes,Graduate Texts in Mathematics, vol. 152, Springer, Definition 2.1, p. 51,ISBN 9780387943657.
  2. ^Weisstein, Eric W. "Polygon Edge". From Wolfram MathWorld.
  3. ^Weisstein, Eric W. "Polytope Edge". From Wolfram MathWorld.
  4. ^Wylie, C. R. Jr. (1964),Foundations of Geometry, New York: McGraw-Hill, p. 64
  5. ^Wylie 1964, p. 68.
  6. ^Senechal, Marjorie (2013),Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination, Springer, p. 81,ISBN 9780387927145.
  7. ^Pisanski, Tomaž;Randić, Milan (2000), "Bridges between geometry and graph theory", in Gorini, Catherine A. (ed.),Geometry at work, MAA Notes, vol. 53, Washington, DC: Math. Assoc. America, pp. 174–194,MR 1782654. See in particular Theorem 3,p. 176.
  8. ^Balinski, M. L. (1961),"On the graph structure of convex polyhedra inn-space",Pacific Journal of Mathematics,11 (2):431–434,doi:10.2140/pjm.1961.11.431,MR 0126765.
  9. ^Wenninger, Magnus J. (1974),Polyhedron Models, Cambridge University Press, p. 1,ISBN 9780521098595.
  10. ^Seidel, Raimund (1986), "Constructing higher-dimensional convex hulls at logarithmic cost per face",Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (STOC '86), pp. 404–413,doi:10.1145/12130.12172,ISBN 0-89791-193-8,S2CID 8342016.

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Edge_(geometry)&oldid=1334564550"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp