Triangulating Simple Polygons and Equivalent Problems

  title={Triangulating Simple Polygons and Equivalent Problems},
  author={Alain Fournier and Delfin Y. Montuno},
  journal={ACM Trans. Graph.},
It' has long been known that the complexity of triangulation of simple polygons having an upper bound of 0 (n log n) but a lower bound higher than ~(n) has not been proved yet. We propose here an easily implemented route to the triangulation of simple polygons through the trapezoidization of simple polygons, which is currently done in O(n log n). Then the trapezoidized polygons are triangulated in O(n) time. Both of those steps can be performed on polygons with holes with the same complexity… 
A linear-time algorithm for triangulating simple polygons
This work shows how to triangulate a simple polygon in O (n) time and suggests an approach to the triangulation problem: use Jordan sorting in a divide-and-conquer fashion.
Linear-time triangulation of a simple polygon made easier via randomization
The new algorithm can be viewed as a combination of Chazelle's algorithm and of non-optimal randomized algorithms due to Clarkson et al. (1991) and to Seidel (1991), with the essential innovation that sampling is performed on subchains of the initial polygonal chain, rather than on its edges.
Triangulating a Polygon in Parallel
Efficient triangulation of simple polygons
This paper considers the topic of efficiently traingulating a simple polygon with emphasis on practical and easy-to-implement algorithms and describes a new adaptive algorithm for triangulating a simplen-sided polygon that is the first polygon triangulation algorithm where the computational complexity is a function of the output complexity.
Tr iangulating Simple Polygons : Pseudo-Triangulations
Triangulating a gi ven n-vertex simple polygon means to partition the interior of the polygon inton − 2 triangles by addingn − 3 nonintersecting diagonals. Significantheoretical advances ha ve
Polygon triangulation inO(n log logn) time with simple data structures
A newO(n log logn)-time deterministic algorithm for triangulating simplen-vertex polygons, which avoids the use of complicated data structures and has other interesting applications, including a linear-time algorithm to convert a Steiner triangulation of a polygon into a true triangulations.
An output-complexity-sensitive polygon triangulation algorithm
This paper describes a new algorithm for triangulating a simple n-sided polygon and introduces a new measure of the complexity of a polygon triangulation that should find application in other contexts as well.
Triangulating multiply‐connected polygons: A simple, yet efficient algorithm.
We present a new, simple, yet efficient algorithm for triangulating multiply‐connected polygons. The algorithm requires sorting only local concave minima (sags). The order in which triangles are
The minimality formula and bounds for A * ( P )
It is shown that the minimum number of triangles required to partition a simple n-gon is equal to n + 2w d 2, where w is the number of holes and d is the maximum number of independent degenerate triangles of the n-agon.


Minimum partition of polygonal regions into trapezoids
  • T. AsanoTakao Asano
  • Mathematics
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
This paper shows the problem of partitioning a polygonal region into a minimum number of trapezoids with two horizontal sides to be NP-complete, and presents an O(n log n) natural approximation algorithm which uses only horizontal chords to partition a polyagonal region P into trapezoid, where n is the number of vertices of P.
The Power of Non-Rectilinear Holes
Four multiconnected-polygon partition problems are shown to be NP-hard. bltroduction One of the main topics of computational geometry is the problem of optimally partitioning figures into simpler
Decomposing a polygon into its convex parts
This work considers the problem of decomposing a simple (non-convex) polygon into the union of a minimal number of convex polygons and reaches polynomial time bounded algorithms for exact solution as well as low degree polynometric time bounded algorithm/or approximation methods.
An Optimal Algorithm for Finding the Kernel of a Polygon
It is shown that one can exploit the ordering of the half-planes corresponding to the sequence of the polygon's edges to obtain a kernel finding algorithm which runs m time O(n) and is therefore optimal.
Optimal Search in Planar Subdivisions
This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage.
On triangulations of a set of points in the plane
  • E. Lloyd
  • Mathematics
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
It is shown that the problem of determining the existence of a triangulation, in a given subset of the line segments whose endpoints are in V, is NP-Complete.
Geometric complexity
  • M. Shamos
  • Mathematics, Computer Science
  • 1975
An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity.
An efficient algorithm for decomposing a polygon into star-shaped polygons
Shading of regions on vector display devises
An algorithm for shading the interior of the polygon with a set of parallel lines where the slope and the distance between lines are prespecified and generalizable to shade any region or regions of an arbitrary planar subdivision.
Fast Triangulation of Simple Polygons
A new algorithm for triangulating simple polygons that has four advantages over previous solutions is presented, which are shown to be simple, elegant and Turing-complete.