|
Edge (geometry)
In geometry, an edge is a particular type of line segment joining two vertex (geometry), vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two Face (geometry), faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. An ''edge'' may also be an infinite line (geometry), line separating two half-planes. The ''sides'' of a plane angle are semi-infinite Half-line (geometry), half-lines (or rays). Relation to edges in graphs In graph theory, an Edge (graph theory), edge is an abstract object connecting two vertex (graph theory), graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its n-s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (: vertices or vertexes), also called a corner, is a point (geometry), point where two or more curves, line (geometry), lines, or line segments Tangency, meet or Intersection (geometry), intersect. For example, the point where two lines meet to form an angle and the point where edge (geometry), edges of polygons and polyhedron, polyhedra meet are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Plane Angle
In Euclidean geometry, an angle can refer to a number of concepts relating to the intersection of two straight Line (geometry), lines at a Point (geometry), point. Formally, an angle is a figure lying in a Euclidean plane, plane formed by two Ray (geometry), rays, called the ''Side (plane geometry), sides'' of the angle, sharing a common endpoint, called the ''vertex (geometry), vertex'' of the angle. More generally angles are also formed wherever two lines, rays or line segments come together, such as at the corners of triangles and other polygons. An angle can be considered as the region of the plane bounded by the sides. Angles can also be formed by the intersection of two planes or by two intersecting curves, in which case the rays lying tangent to each curve at the point of intersection define the angle. The term ''angle'' is also used for the size, magnitude (mathematics), magnitude or Physical quantity, quantity of these types of geometric figures and in this context an a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cube (geometry)
A cube or regular hexahedron is a three-dimensional space, three-dimensional solid object in geometry, which is bounded by six congruent square (geometry), square faces, a type of polyhedron. It has twelve congruent edges and eight vertices. It is a type of parallelepiped, with pairs of parallel opposite faces, and more specifically a rhombohedron, with congruent edges, and a rectangular cuboid, with right angles between pairs of intersecting faces and pairs of intersecting edges. It is an example of many classes of polyhedra: Platonic solid, regular polyhedron, parallelohedron, zonohedron, and plesiohedron. The dual polyhedron of a cube is the regular octahedron. The cube can be represented in many ways, one of which is the graph known as the cubical graph. It can be constructed by using the Cartesian product of graphs. The cube is the three-dimensional hypercube, a family of polytopes also including the two-dimensional square and four-dimensional tesseract. A cube with 1, unit s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler's Polyhedron Formula
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by \chi ( Greek lower-case letter chi). The Euler characteristic was originally defined for polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant. In modern mathematics, the Euler characteristic arises from homology and, more abstractly, homological algebra. Polyhedra The Euler characteristic was classically defined for the surfaces of polyhedra, according ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Face (geometry)
In solid geometry, a face is a flat surface (a Plane (geometry), planar region (mathematics), region) that forms part of the boundary of a solid object. For example, a cube has six faces in this sense. In more modern treatments of the geometry of polyhedra and higher-dimensional polytopes, a "face" is defined in such a way that it may have any dimension. The vertices, edges, and (2-dimensional) faces of a polyhedron are all faces in this more general sense. Polygonal face In elementary geometry, a face is a polygon on the boundary of a polyhedron. (Here a "polygon" should be viewed as including the 2-dimensional region inside it.) Other names for a polygonal face include polyhedron side and Euclidean plane ''tessellation, tile''. For example, any of the six square (geometry), squares that bound a cube is a face of the cube. Sometimes "face" is also used to refer to the 2-dimensional features of a 4-polytope. With this meaning, the 4-dimensional tesseract has 24 square faces, each ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler Characteristic
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by \chi (Greek alphabet, Greek lower-case letter chi (letter), chi). The Euler characteristic was originally defined for polyhedron, polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant. In modern mathematics, the Euler characteristic arises from homology (mathematics), homology and, more abstractly, homological algebra. Polyhedra The Euler characteristic was ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polyhedron
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal faces, straight edges and sharp corners or vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Euler characteristic, duality, vertex figures, surface area, volume, interior lines, Dehn invar ... [...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] |
K-vertex-connected Graph
In graph theory, a connected Graph (discrete mathematics), graph is said to be -vertex-connected (or -connected) if it has more than Vertex (graph theory), vertices and remains Connectivity (graph theory), connected whenever fewer than vertices are removed. The vertex-connectivity, or just connectivity, of a graph is the largest for which the graph is -vertex-connected. Definitions A graph (other than a complete graph) has connectivity ''k'' if ''k'' is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them. In complete graphs, there is no subset whose removal would disconnect the graph. Some sources modify the definition of connectivity to handle this case, by defining it as the size of the smallest subset of vertices whose deletion results in either a disconnected graph or a single vertex. For this variation, the connectivity of a complete graph K_n is n-1. An equivalent definition is that a graph with at least two vertic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Steinitz's Theorem
In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedron, convex polyhedra: they are exactly the vertex connectivity, 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs. This result provides a classification theorem for the three-dimensional convex polyhedra, something that is not known in higher dimensions. It provides a complete and purely combinatorial description of the graphs of these polyhedra, allowing other results on them, such as Eberhard's theorem on the realization of polyhedra with given types of faces, to be proven more easily, without reference to the geometry of these shapes. Additionally, it has been applied in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-skeleton
In mathematics, particularly in algebraic topology, the of a topological space presented as a simplicial complex (resp. CW complex) refers to the subspace that is the union of the simplices of (resp. cells of ) of dimensions In other words, given an inductive definition of a complex, the is obtained by stopping at the . These subspaces increase with . The is a discrete space, and the a topological graph. The skeletons of a space are used in obstruction theory, to construct spectral sequences by means of filtrations, and generally to make inductive arguments. They are particularly important when has infinite dimension, in the sense that the do not become constant as In geometry In geometry, a of P (functionally represented as skel''k''(''P'')) consists of all elements of dimension up to ''k''. For example: : skel0(cube) = 8 vertices : skel1(cube) = 8 vertices, 12 edges : skel2(cube) = 8 vertices, 12 edges, 6 square faces For simplicial sets The above ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (graph Theory)
In discrete mathematics, and more specifically 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). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another. From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex ''w'' is said to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
