Gromov's inequality for complex projective space: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>ChrisGualtieri
m Typo fixing, typos fixed: , → , , et al → et al. using AWB
 
en>Colonies Chris
m sp, date & link fixes; unlinking common words, replaced: Fubini-Study → Fubini–Study using AWB
 
Line 1: Line 1:
{{Unreferenced|date=July 2008}}
Hi there, I am Alyson Boon even though it is not the title on my beginning certificate. Playing  [http://kjhkkb.net/xe/notice/374835 best psychic readings] badminton is a factor that he is completely addicted to. She functions as a journey agent but soon she'll be on her personal. Alaska is the only place I've been residing in but now I'm considering other choices.<br><br>Feel free to visit my web page - [http://1.234.36.240/fxac/m001_2/7330 psychic readings] solutions by lynne ([http://formalarmour.com/index.php?do=/profile-26947/info/ Link Home Page])
[[Image:Chainline.svg|thumb|right|A simple polygonal chain]]
[[Image:Self crossed polygonal chain.svg|thumb|right|A self-intersecting polygonal chain]]
[[Image:Closed polygonal line.svg|thumb|right|A closed polygonal chain]]
A '''polygonal chain''', '''polygonal curve''', '''polygonal path''', or '''piecewise linear curve''', is a connected series of [[line segment]]s. More formally, a polygonal chain ''P'' is a [[curve]] specified by a [[sequence]] of points <math>\scriptstyle(A_1, A_2, \dots, A_n)</math> called its '''vertices''' so that the curve consists of the line segments connecting the consecutive vertices.
 
In [[computer graphics]] a '''polygonal chain''' is called a '''polyline''' and is often used to approximate curved paths.
 
A '''simple polygonal chain''' is one in which only consecutive (or the first and the last) segments intersect and only at their endpoints.
 
A '''closed polygonal chain''' is one in which the first vertex coincides with the last one, or, alternatively, the first and the last vertices are also connected by a line segment. A simple closed polygonal chain in [[the plane]] is the boundary of a [[simple polygon]]. Often the term "[[polygon]]" is used in the meaning of "closed polygonal chain".
 
In some cases it is important to draw a distinction between a [[polygonal area]] and a polygonal chain.  
 
A polygonal chain is called '''monotone''', if there is a [[straight line]] ''L'' such that every line perpendicular to ''L'' intersects the chain at most once. Every nontrivial monotone polygonal chain is open. Compare with "[[monotone polygon]]".
If that straight line is horizontal, then the polygonal chain is a [[piecewise linear function]].
 
==Application and problems==
[[Image:Euler method.png|left|thumb|Polygonal curve approximation: the unknown curve is in blue, and a polygonal approximation is in red.]]
 
Polygonal curves can be used to approximate other curves and boundaries of real-life objects.
 
== See also ==
* [[Polygon mesh]] - A 2-dimensional surface created by a connected network of polygons.
* [[Simplicial complex]] - a higher dimensional generalization limited to [[simplex]] facets
* [[Maurer rose]]
 
[[Category:Polygons]]
[[Category:Curves]]

Latest revision as of 20:01, 13 March 2014

Hi there, I am Alyson Boon even though it is not the title on my beginning certificate. Playing best psychic readings badminton is a factor that he is completely addicted to. She functions as a journey agent but soon she'll be on her personal. Alaska is the only place I've been residing in but now I'm considering other choices.

Feel free to visit my web page - psychic readings solutions by lynne (Link Home Page)