Search results
Jump to navigation
Jump to search
- This result establishes, considering prime-power regular polygons less than the 100-gon, that it is impossible to construct the 23-, 29-, 43- ...th an auxiliary curve|auxiliary curves]]; yet this is true for all regular polygons.<ref>{{cite journal ...6 KB (879 words) - 04:52, 16 December 2024
- ...visibility]], decompositions of polygons, [[Covering problems|coverings of polygons]], triangulations and triangulation algorithms, and higher-dimensional gene ...-shaped polygon]]s, spiral polygons, and [[monotone polygon]]s; non-simple polygons; prison yard problems, in which the guards must view the exterior, or both ...5 KB (766 words) - 19:44, 24 November 2024
- ...fferent method for producing nets that does not always produce star-shaped polygons.{{r|gfa}} [[Category:Polygons]] ...3 KB (436 words) - 07:34, 11 January 2024
- In particular this is true for regular polygons with evenly many sides, in which case the parallelograms are all rhombi. Fo ==Related polygons== ...10 KB (1,334 words) - 10:57, 11 January 2024
- In [[computational geometry]], the '''star unfolding''' of a [[convex polyhedron]] is a [[Net (polyhedron)|net]] obtai In more detail, the star unfolding is obtained from a polyhedron <math>P</math> by choosing a starti ...6 KB (747 words) - 07:47, 11 March 2024
- [[File:Star polygon 9 4.png|thumb|The boundary of the regular [[Enneagram (geometry)|en In [[geometry]], the '''density''' of a [[star polyhedron]] is a generalization of the concept of [[winding number]] from ...10 KB (1,401 words) - 09:34, 1 October 2024
- ...finding a smallest set covering is NP-complete, but for special classes of polygons, a smallest polygon covering can be found in polynomial time. ...142/S021819599600006X| title = A Linear-Time Algorithm for Covering Simple Polygons with Similar Rectangles| journal = International Journal of Computational G ...17 KB (2,539 words) - 09:29, 16 July 2024
- [[File:Polygons with holes.png|thumb|upright=1.6|Polygons with holes, with simply connected brown regions and interior boundaries, in | image1 = Not-star-shaped.png ...6 KB (821 words) - 04:26, 18 July 2024
- ...ling]]s of the [[Euclidean plane]] [[Tiling by regular polygons|by regular polygons]], containing regular [[triangle]]s, [[square]]s, and [[dodecagon]]s, arran ...omorphic]] to the ambo operation on the tiling, with the cyan and pink gap polygons corresponding to the cyan and pink circles (one dimensional duals to the re ...6 KB (884 words) - 17:49, 7 November 2024
- The megagon is also used as an illustration of the convergence of regular polygons to a circle.<ref>{{Cite book |last=Russell |first=Bertrand |url=https://boo ...500,000 that is [[coprime]] to 1,000,000. There are also 300,000 regular [[star figure]]s in the remaining cases. ...8 KB (1,261 words) - 12:36, 28 October 2024
- * In [[VLSI]] artwork data processing, layouts are represented as polygons, and one approach to preparation for electron-beam lithography is to decomp ...example. A strategy for solving some of these types of problems on general polygons is to decompose the polygon into simple component parts, solve the problem ...20 KB (2,836 words) - 07:53, 22 July 2024
- ...itetrahedra are near-[[Sphere|spherical]], but are not composed of regular polygons. A minimum of 14 vertices is required to form a icositetahedron.<ref>{{Cit 27 [[List of uniform polyhedra|uniform star-polyhedral duals]]: (self-intersecting) ...12 KB (1,449 words) - 23:34, 25 February 2025
- ==== Polygons ==== ...ffrey |last2=Shepard |author-link2=G.C. Shephard |title=Tilings by Regular Polygons |date=November 1977 |url=http://www.maa.org/sites/default/files/images/uplo ...18 KB (2,403 words) - 04:15, 5 February 2025
- ...ersecting]]. A self-intersecting ''regular pentagon'' (or ''[[star polygon|star]] pentagon'') is called a [[pentagram]]. ...1=Meskhishvili |first1=Mamuka |date=2020 |title=Cyclic Averages of Regular Polygons and Platonic Solids |url=https://www.rgnpublications.com/journals/index.php ...24 KB (3,478 words) - 13:12, 14 December 2024
- There are six [[Convex polytope|convex]] and ten [[star polytope|star]] regular 4-polytopes, giving a total of sixteen. Schläfli also found four of the regular star 4-polytopes: the [[grand 120-cell]], [[great stellated 120-cell]], [[grand ...27 KB (3,498 words) - 09:01, 15 October 2024
- ...y_a_star-like_quadrilateral.png|thumb|center|400px|Cyclogon generated by a star-like quadrilateral]] ...another regular polygonal disk with m sides. The edges of the two regular polygons are assumed to have the same length. A point z attached rigidly to the n-go ...5 KB (728 words) - 20:08, 11 September 2023
- {{Short description|5-sided star shaped polygon}} '''''Pentagramma mirificum''''' ([[Latin]] for "miraculous pentagram") is a [[star polygon]] on a [[sphere]], composed of five [[great circle]] [[arc (geometr ...7 KB (1,014 words) - 19:41, 3 January 2025
- |[[File:Equilateral_pentagon-decatile2.svg|100px]]<BR>Regular star<BR>[[pentagram]]<BR>(36°) ...ef>De Villiers, Michael, "Equiangular cyclic and equilateral circumscribed polygons", [[Mathematical Gazette]] 95, March 2011, 102-107.</ref> ...9 KB (1,298 words) - 22:12, 9 September 2022
- ...that are in [[general position]], meaning that no three are on a line.{{r|star-shaped}} With this assumption, the angle between two consecutive segments o ...ygon]] through all the given points, with <math>q</math> in its kernel.{{r|star-shaped}} The same idea of sorting points radially around a central point is ...26 KB (3,389 words) - 14:46, 29 July 2024
- ...s Petrie]] generalized the concept of [[regular skew polygon]]s (nonplanar polygons) to ''regular skew polyhedra''. ...rs and relations for discrete groups, Sec 8.6 Maps having specified Petrie polygons. p. 110</ref> ...14 KB (1,749 words) - 11:19, 6 February 2025