# Edge (geometry)

Edge (geometry)

:"For edge in graph theory, see Edge (graph theory)"

In geometry, an edge is a one-dimensional line segment joining two zero-dimensional vertices in a polytope. Thus applied, an edge is a connector for a one-dimensional line segment and two zero-dimensional objects.

A planar closed sequence of edges forms a polygon (and a face).

* Vertex (geometry)
* Face (geometry)
* Cell (geometry)
* Facet (geometry)

*
*
*

Wikimedia Foundation. 2010.

Поможем написать реферат

### Look at other dictionaries:

• Edge — An edge in common usage denotes a sharp border of a (solid) object.cience and technology* Edge (graph theory), a line segment joining two nodes in a graph * Edge (geometry), a line segment joining two vertices in a polytope * Edge case, a problem …   Wikipedia

• Edge detection — is a terminology in image processing and computer vision, particularly in the areas of feature detection and feature extraction, to refer to algorithms which aim at identifying points in a digital image at which the image brightness changes… …   Wikipedia

• Edge loops — are a 3D modeling concept that allows relatively little geometry to convey relatively large amounts of spatial information in a given mesh object. This determines the “flow” of geometry over a surface, and usually has an influence over the… …   Wikipedia

• Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

• Edge-transitive graph — In mathematics, an edge transitive graph is a graph G such that, given any two edges e 1 and e 2 of G , there is an automorphism of G that maps e 1 to e 2.In other words, a graph is edge transitive if its automorphism group acts transitively upon …   Wikipedia

• Descriptive geometry — is the branch of geometry which allows the representation of three dimensional objects in two dimensions, by using a specific set of procedures. The resulting techniques are important for engineering, architecture, design and in art. [1] Drawing… …   Wikipedia

• Greek arithmetic, geometry and harmonics: Thales to Plato — Ian Mueller INTRODUCTION: PROCLUS’ HISTORY OF GEOMETRY In a famous passage in Book VII of the Republic starting at Socrates proposes to inquire about the studies (mathēmata) needed to train the young people who will become leaders of the ideal… …   History of philosophy

• Dowling geometry — In combinatorial mathematics, a Dowling geometry, named after Thomas A. Dowling, is a matroid associated with a group. There is a Dowling geometry of each rank for each group. If the rank is at least 3, the Dowling geometry uniquely determines… …   Wikipedia

• Solid Edge — Infobox Software name = Solid Edge caption = developer = Siemens PLM Software latest release version = Solid Edge with Synchronous Technology latest release date = 2008 operating system = Windows XP/Vista genre = CAD software license = website =… …   Wikipedia

• Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects …   Wikipedia