polygon

(redirected from N-gon)
Also found in: Thesaurus, Encyclopedia.
click for a larger image
polygon
regular (left) and irregular (right) polygons

pol·y·gon

 (pŏl′ē-gŏn′)
n.
A closed plane figure bounded by three or more line segments.

[Late Latin polygōnum, from Greek polugōnon, from neuter of Greek polugōnos, polygonal : polu-, poly- + -gōnos, angled; see -gon.]

po·lyg′o·nal (pə-lĭg′ə-nəl) adj.
po·lyg′o·nal·ly adv.

polygon

(ˈpɒlɪˌɡɒn)
n
(Mathematics) a closed plane figure bounded by three or more straight sides that meet in pairs in the same number of vertices, and do not intersect other than at these vertices. The sum of the interior angles is (n–2) × 180° for n sides; the sum of the exterior angles is 360°. A regular polygon has all its sides and angles equal. Specific polygons are named according to the number of sides, such as triangle, pentagon, etc
[C16: via Latin from Greek polugōnon figure with many angles]
polygonal adj
poˈlygonally adv

pol•y•gon

(ˈpɒl iˌgɒn)

n.
a figure, esp. a closed plane figure, having three or more, usu. straight, sides.
[1560–70; < Latin polygōnum < Greek polýgōnon, n. use of neuter of polýgōnos many-angled. See poly-, -gon]
po•lyg•o•nal (pəˈlɪg ə nl) adj.
po•lyg′o•nal•ly, adv.

pol·y·gon

(pŏl′ē-gŏn′)
A closed plane figure having three or more sides. Triangles, rectangles, and octagons are all examples of polygons.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.polygon - a closed plane figure bounded by straight sidespolygon - a closed plane figure bounded by straight sides
plane figure, two-dimensional figure - a two-dimensional shape
isogon - an equiangular polygon
convex polygon - a polygon such that no side extended cuts any other side or vertex; it can be cut by a straight line in at most two points
concave polygon - a polygon such that there is a straight line that cuts it in four or more points
quadrangle, quadrilateral, tetragon - a four-sided polygon
triangle, trigon, trilateral - a three-sided polygon
pentagon - a five-sided polygon
hexagon - a six-sided polygon
heptagon - a seven-sided polygon
octagon - an eight-sided polygon
nonagon - a nine-sided polygon
decagon - a polygon with 10 sides and 10 angles
undecagon - an eleven-sided polygon
dodecagon - a twelve-sided polygon
spherical polygon - a figure on the surface of a sphere bounded by arcs of 3 or more great circles
Translations
شَكل مُتَعَدِّد الأضْلاعمضلع
многоъгълник
polígon
mnohoúhelníkpolygon
polygon
pluranguloplurlateropoligono
hulknurk
monikulmiopolygoni
mnogokut
sokszögpoligon
marghyrningur
ポリゴン多角形
다각형
daugiakampis
daudzstūris
ബഹുഭുജം
wielobokwielokąt
poligon
mnohouholníkpolygón
mnogokotnik
polygon
pembenyingi
รูปหลายเหลี่ยม
багатокутник
کثیرالاضلاع
đa giác

polygon

[ˈpɒlɪgən] Npolígono m

polygon

nPolygon nt, → Vieleck nt

polygon

[ˈpɒlɪgən] npoligono

polygon

(ˈpoligən) , ((American) -gon) noun
a two-dimensional figure with many angles and sides.
poˈlygonal (-ˈli-) adjective
References in periodicals archive ?
n - 1, n), (n, 1) as well as some n - 3 non-crossing diagonals that subdivide the n-gon into triangles.
2](0,t) of a convex particle Y is almost surely convex and can be approximated by a convex n-gon K[subset][R.
Smarandache (1983) has generalized the Theorem of Menelaus for any polygon with n [greater than or equal to] 4 sides as follows: If a line l intersects the n-gon [A.
The questions are difficult and time constraints can make it difficult to solve such problems as "the sum of the numbers of faces, edges and vertices of a pyramid with an n-gon base," he said.
A convex lattice n-gon contains at least I(n) interior points.
To create a Gray code for sequences of length 1 use one copy of an N-gon (a regular two-dimensional polygon with N sides, with a 2-gon being a line segment) with labels [0], [1], .
Let A be a twisted n-gon indexed by Z, and let y = ([y.
This includes a nice demonstration of the fact known to Archimedes that the area of the inscribed regular 2n-gon is numerically the same as half the perimeter of the inscribed regular n-gon (p.
In (1), the two extreme cases, k = n - 1 and k = 2n - 3, correspond to non-crossing spanning trees and n-gon triangulations respectively.
Subsequently Gauss presented this result at the end of Disquistiones Arithmeticae, in which he proves the constructibility of the n-gon for any n that is a prime of the form
At first, he was interested in a generalisation of triangulations, where the objects under consideration are maximal sets of diagonals of the n-gon, such that at most k diagonals are allowed to cross mutually.
A k-triangulation of a convex n-gon is a maximal collection of diagonals in the n-gon such that no k + 1 diagonals mutually cross.