Live briefing
Everything about Simple polygon
Shape bounded by non-intersecting line segments
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 finitely many line segments. These polygons include as special cases the convex polygons, star-shaped polygons, and monotone polygons. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Simple polygonA 5-minute orientation
- Skim a recent paper: Approximation Algorithms for the Two-Watchman Route in a Simple PolygonInfluential work since 2022
- Pick up a classic book: A Text-book on Roofs and BridgesThe most-reprinted book on the subject
- Read the landmark paper: Triangulating a simple polygon in linear timeCited 385 times
- Go sideways: Convex polygonA closely related topic
- Go sideways: Polygon triangulationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Triangulating a simple polygon in linear time
Finding the convex hull of a simple polygon
Finding the convex hull of a simple polygon
Triangulating a simple polygon
Optimal shortest path queries in a simple polygon
Visibility of a simple polygon
Computing the geodesic center of a simple polygon
Theorems on the Simple Finite Polygon and Polyhedron
🆕 Influential since 2022
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
Simple integrated circuit reverse-engineering with deep learning: A proof of concept for automating die-polygon-capturing
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
A divide-and-conquer based preprocessing for routing in a simple polygon
Spanning simple path inside a simple polygon
📚 Books worth reading
A Text-book on Roofs and BridgesMansfield Merriman, Henry Sylvester Jacoby · 1879- 📕Cloud NotebookAoi · 2018
3D math primer for graphics and game developmentFletcher Dunn · 2002- 📕Check Register BookLeonard Gonzalez · 2021
Saxon Math 8/7Stephen Hake · 2003
SPSS BasicsZealure C. Holcomb · 2006
Introductory technical mathematicsRobert Donald Smith, John Peterson · 2006
Object-oriented software constructionBertrand Meyer · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Convex polygon In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is…
- 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…
- Pseudotriangle In Euclidean plane geometry, a pseudotriangle (pseudo-triangle) is the simply connected subset of the plane that lies between any three mutually tangent…
- Two ears theorem In geometry, the two ears theorem states that every simple polygon with more than three vertices has at least two ears, vertices that can be removed from…
- Constrained Delaunay triangulation In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments…
- Polygonalization 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…
- Triangle A triangle or trigon is a polygon consisting of three sides connected at three corners. It is one of the basic shapes in geometry and the simplest of polygons…
- Vertex (geometry) In geometry, a vertex (pl.: vertices or vertexes), also called a corner, is a point where two or more curves, lines, or line segments meet or intersect…