# GetWiki

*Vertex (geometry)*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

Vertex (geometry)

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**vertex**(plural:

**vertices**or

**vertexes**) is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices.{{Mathworld|title=Vertex|id=Vertex}}

## Definition

### Of an angle

(File:Two rays and one vertex.png|thumb|right|A vertex of an angle is the endpoint where two line segments or rays come together.)The*vertex*of an angle is the point where two 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.BOOK, Heath, Thomas L., T. L. Heath, The Thirteen Books of Euclid's Elements, 2nd ed. [Facsimile. Original publication: Cambridge University Press, 1925], 1956, Dover Publications, New York,

(3 vols.): {{isbn|0-486-60088-2}} (vol. 1), {{isbn|0-486-60089-0}} (vol. 2), {{isbn|0-486-60090-4}} (vol. 3).

### Of a polytope

A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection of edges, faces or facets of the object.In a polygon, a vertex is called "convex" if the internal angle of the polygon, that is, the angle formed by the two edges at the vertex, with the polygon inside the angle, is less than Ï€ radians ( 180Â°, two right angles) ; otherwise, it is called "concave" or "reflex".BOOK, Jing, Lanru, Stephansson, Ove, Fundamentals of Discrete Element Methods for Rock Engineering: Theory and Applications, 2007, Elsevier Science, More generally, a vertex of a polyhedron or polytope is convex if the intersection of the polyhedron or polytope with a sufficiently small sphere centered at the vertex is convex, and concave otherwise.Polytope vertices are related to vertices of graphs, in that the 1-skeleton of a polytope is a graph, the vertices of which correspond to the vertices of the polytope,Peter McMullen, Egon Schulte, Abstract Regular Polytopes, Cambridge University Press, 2002. {{isbn|0-521-81496-0}} (Page 29) and in that a graph can be viewed as a 1-dimensional simplicial complex the vertices of which are the graph's vertices. However, in graph theory, vertices may have fewer than two incident edges, which is usually not allowed for geometric vertices. There is also a connection between geometric vertices and the vertices of a curve, its points of extreme curvature: in some sense the vertices of a polygon are points of infinite curvature, and if a polygon is approximated by a smooth curve there will be a point of extreme curvature near each polygon vertex.BOOK, Alexander I., Bobenko, Peter, SchrÃ¶der, John M. Sullivan (mathematician), John M., Sullivan, GÃ¼nter M. Ziegler, GÃ¼nter M., Ziegler, Discrete differential geometry, BirkhÃ¤user Verlag AG, 2008, 978-3-7643-8620-7, However, a smooth curve approximation to a polygon will also have additional vertices, at the points where its curvature is minimal.### Of a plane tiling

A vertex of a plane tiling or tessellation is a point where three or more tiles meet;M.V. Jaric, ed, Introduction to the Mathematics of Quasicrystals (Aperiodicity and Order, Vol 2) {{isbn|0-12-040602-0}}, Academic Press, 1989. generally, but not always, the tiles of a tessellation are polygons and the vertices of the tessellation are also vertices of its tiles. More generally, a tessellation can be viewed as a kind of topological cell complex, as can the faces of a polyhedron or polytope; the vertices of other kinds of complexes such as simplicial complexes are its zero-dimensional faces.## Principal vertex

File:Polygon mouths and ears.svg|thumb|right|Vertex B is an ear, because the open line segmentopen line segmentA polygon vertex {{math|*x*i}} of a simple polygon {{mvar|P}} is a principal polygon vertex if the diagonal {{math|[

*x*(i âˆ’ 1),

*x*(i + 1)]}} intersects the boundary of {{mvar|P}} only at {{math|

*x*(i âˆ’ 1)}} and {{math|

*x*(i + 1)}}. There are two types of principal vertices:

*ears*and

*mouths*."MEMBERWIDE">FIRST1=SATYANAUTHOR2-LINK= JOSEPH O'ROURKE (PROFESSOR)LAST2= O'ROURKE TITLE = DISCRETE AND COMPUTATIONAL GEOMETRY, Princeton University Press, 978-0-691-14553-2,weblink

### Ears

A principal vertex {{math|*x*i}} of a simple polygon {{mvar|P}} is called an ear if the diagonal {{math|[

*x*(i âˆ’ 1),

*x*(i + 1)]}} that bridges {{math|

*x*i}} lies entirely in {{mvar|P}}. (see also convex polygon) According to the two ears theorem, every simple polygon has at least two ears.{{citation

| last = Meisters | first = G. H.

| journal = The American Mathematical Monthly

| mr = 0367792

| pages = 648â€“651

| title = Polygons have ears

| volume = 82

| year = 1975

| doi=10.2307/2319703}}.

| journal = The American Mathematical Monthly

| mr = 0367792

| pages = 648â€“651

| title = Polygons have ears

| volume = 82

| year = 1975

| doi=10.2307/2319703}}.

### Mouths

A principal vertex {{math|*x*i}} of a simple polygon {{mvar|P}} is called a mouth if the diagonal {{math|[

*x*(i âˆ’ 1),

*x*(i + 1)]}} lies outside the boundary of {{mvar|P}}.

## Number of vertices of a polyhedron

Any convex polyhedron's surface has Euler characteristic
V - E + F = 2,

where {{math|*V*}} is the number of vertices, {{math|

*E*}} is the number of edges, and {{math|

*F*}} is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces. For example, a cube has 12 edges and 6 faces, and hence 8 vertices.

## Vertices in computer graphics

In computer graphics, objects are often represented as triangulated polyhedra in which the object vertices are associated not only with three spatial coordinates but also with other graphical information necessary to render the object correctly, such as colors, reflectance properties, textures, and surface normal;WEB, Christen

, Martin

, Khronos Group

, Clockworkcoders Tutorials: Vertex Attributes

,weblink

, 26 January 2009, these properties are used in rendering by a vertex shader, part of the vertex pipeline.

, Martin

, Khronos Group

, Clockworkcoders Tutorials: Vertex Attributes

,weblink

, 26 January 2009, these properties are used in rendering by a vertex shader, part of the vertex pipeline.

## References

{{reflist}}## External links

- {{mathworld |title=Polygon Vertex |urlname=PolygonVertex}}
- {{mathworld |title=Polyhedron Vertex |urlname=PolyhedronVertex}}
- {{mathworld |title=Principal Vertex |urlname=PrincipalVertex}}

**- content above as imported from Wikipedia**

- "

- time: 9:03pm EDT - Wed, Jul 17 2019

- "

__Vertex (geometry)__" does not exist on GetWiki (yet)- time: 9:03pm EDT - Wed, Jul 17 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 JUL 2019

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED