Live briefing
Everything about Polygonalization
Polygon through a set of points
In computational geometry, a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices. A polygonalization may also be called a polygonization, simple polygonalization, Hamiltonian polygon, non-crossing Hamiltonian cycle, or crossing-free straight-edge spanning cycle. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: PolygonalizationA 5-minute orientation
- Skim a recent paper: Experimental and numerical investigation into development mechanism of wheel polygonalizationInfluential work since 2022
- Pick up a classic book: Geometry of Higher-Dimensional PolytopesThe most-reprinted book on the subject
- Read the landmark paper: Out-of-round railway wheels—a study of wheel polygonalization through simulation of three-dimensional wheel–rail interaction and wearCited 185 times
- Go sideways: Simple polygonA closely related topic
- Go sideways: Monotone polygonA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Out-of-round railway wheels—a study of wheel polygonalization through simulation of three-dimensional wheel–rail interaction and wear
POLYGONALIZATION OF WHEEL TREADS CAUSED BY STATIC AND DYNAMIC IMBALANCES
A study of formation of high order wheel polygonalization
Polygonalization of railway wheels
Effect of the unstable vibration of the disc brake system of high-speed trains on wheel polygonalization
Adaptive polygonalization of implicitly defined surfaces
A simple mechanism for the polygonalization of railway wheels by wear
Experimental and Numerical Investigation into Formation of Metro Wheel Polygonalization
🆕 Influential since 2022
Experimental and numerical investigation into development mechanism of wheel polygonalization
Dynamic nonstationary representations of a railway vehicle considering wheel polygonalization under variable speed conditions
Effect of Wheel Polygonalization on the Dynamic Characteristics of Gear-Transmission Systems of Urban Railway Vehicles
📚 Books worth reading
- 📕Geometry of Higher-Dimensional PolytopesGennadiy Vladimirovich Zhizhin · 2018
Treks into Intuitive GeometryJin Akiyama, Kiyoko Matsunaga · 2015
Vielecke und Vielflache, Theorie und GeschichteMax Brückner · 1900
N-gonsFriedrich Bachmann · 1975
Islamic Geometric PatternsJay Bonner, Craig Kaplan · 2017- 📕Polygonométrie, ou, De la mesure des figures rectilignesSimon-Antoine-Jean Lhuilier · 1789
Hierarchical Voronoi graphsJan Oliver Wallgrün · 2010- 📕Aperçu de la théorie des polygones réguliersPierre A. L. Anspach · 1955
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Simple polygon In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting of…
- Monotone polygon In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects the boundary of P…
- Polygon triangulation In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set of…
- Polygonal chain In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain P is a curve specified by a sequence of points…
- Art gallery problem The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from the following real-world problem:…
- Opaque set In discrete geometry, an opaque set is a system of curves or other set in the plane that blocks all lines of sight across a polygon, circle, or other shape…
- Point-set triangulation A triangulation of a set of points 𝒫 in the Euclidean space ℝd is a simplicial complex that covers the convex hull of 𝒫, and whose vertices belong to…
- Arrangement of lines In geometry, an arrangement of lines is the subdivision of the Euclidean plane formed by a finite set of lines. An arrangement consists of bounded and…