Live briefing
Everything about Polygon triangulation
Partition of a simple polygon into triangles
In computational geometry, polygon triangulation is the partition of a polygonal area P into a set of triangles, i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Polygon triangulationA 5-minute orientation
- Skim a recent paper: Convex Polygon Triangulation Based on SymmetryInfluential work since 2022
- Pick up a classic book: Sistemas poligonales libres o vinculados indirectamente a puntos trigonométricosThe most-reprinted book on the subject
- Read the landmark paper: Triangulating a simple polygon in linear timeCited 385 times
- Go sideways: Simple polygonA closely related topic
- Go sideways: Two ears theoremA 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
Triangulating a simple polygon
Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons
Planar Separators and Parallel Polygon Triangulation
Parallel triangulation of a polygon in two calls to the trapezoidal map
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
Polygon triangulation: Efficiency and minimality
Polygon triangulation inO(n log logn) time with simple data structures
🆕 Influential since 2022
Convex Polygon Triangulation Based on Symmetry
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
Automatic cladding trajectory generation using polygon triangulation and maximal alternating paths
Fast Shape-Preserving Method for Integrating Polygon into Two-and-Half Dimensional Triangulation
Optimal Triangulation of Polygons
📚 Books worth reading
- 📕Sistemas poligonales libres o vinculados indirectamente a puntos trigonométricosEsteban Horvat · 1973
- 📕Advances in minimum weight triangulationAndrzej Lingas · 1983
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…
- 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…
- 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…
- Point location The point location class of problems is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical…
- Polygon partition In geometry, a partition of a polygon is a set of primitive units (e.g., triangles, rectangles, etc.), which do not overlap and whose union equals the…
- 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:…
- Fan triangulation In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices…
- Polygon covering In geometry, a covering of a polygon is a set of primitive units (e.g. squares) whose union equals the polygon. A polygon covering problem is a problem…