Net (polyhedron) - Wikipedia
In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.[1] An early instance of polyhedral nets appears in the works of Albrecht Dürer, whose 1525 book A Course in the Art of Measurement with Compass and Ruler (Unterweysung der Messung mit dem Zyrkel und Rychtscheyd ) included nets for the Platonic solids and several of the Archimedean solids.[2][3] These constructions were first called nets in 1543 by Augustin Hirschvogel.[4] Many different nets can exist for a given polyhedron, depending on the choices of which edges are joined and which are separated. The edges that are cut from a convex polyhedron to form a net must form a spanning tree of the polyhedron, but cutting some
Net (polyhedron) - Wikipedia Jump to content From Wikipedia, the free encyclopedia Edge-joined polygons which fold into a polyhedron A net of a regular dodecahedron The eleven nets of a cube In geometry , a net of a polyhedron is an arrangement of non-overlapping edge -joined polygons in the plane that can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard. [ 1 ] An early instance of polyhedra
related reading
- Neural Networks, Manifolds, and Topology -- colah's blogcolah.github.io
- Visualizing Delaunay Triangulationianthehenry.com
- Voronoi diagram - Wikipediaen.wikipedia.org
- Polytope model - Wikipediaen.wikipedia.org
- Simplex - Wikipediaen.wikipedia.org
- Flexible Polyhedron -- from Wolfram MathWorldmathworld.wolfram.com
- Steinitz's theorem - Wikipediaen.wikipedia.org
- Algorithmic Mathematical Artxahlee.info
- An OpenAI model has disproved a central conjecture in discrete geometry | OpenAIopenai.com
- Polygon partition - Wikipediaen.wikipedia.org
- n-sphere - Wikipediaen.wikipedia.org
- Fast Polygon Triangulation Based on Seidel's Algorithmgamma.cs.unc.edu