## Triangulation and shape-complexity (1984)

Venue: | ACM Trans. Graph |

Citations: | 42 - 1 self |

### BibTeX

@ARTICLE{Chazelle84triangulationand,

author = {Bernard Chazelle and Janet Incerpi},

title = {Triangulation and shape-complexity},

journal = {ACM Trans. Graph},

year = {1984},

volume = {3},

pages = {135--152}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper describes a new method for triangulating a simple n-sided polygon. The algorithm runs in time O(n log s), with s _< n. The quantity s measures the sinuosity of the polygon, that is, the number of times the boundary alternates between complete spirals of opposite orientation. The value of s is in practice a very small constant, even for extremely winding polygons. Our algorithm is the first method whose performance is linear in the number of vertices, up to within a factor that depends only on the shape-complexity of the polygon. Informally, this notion of shape-complexity measures how entangled a polygon is, and is thus highly independent of the number of vertices. A practical advantage of the algorithm is that it does not require sorting or the use of any balanced tree structure. Aside from the notion of sinuosity, we are also able to characterize a large class of polygons for which the algorithm can be proven to run in O(n log log n) time. The algorithm has been implemented, tested, and empirical evidence has confirmed its theoretical claim to efficiency.

### Citations

456 |
Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams
- Guibas, Stol
- 1985
(Show Context)
Citation Context ...ometric setting defined by the algorithm, such an approach was not only desirable, but absolutely mandatory. Following Guibas and Stolfi's methodological approach to complex geometric implementations =-=[3]-=-, we have attempted to define a small set of powerful primitives in order to separate the combinatorial aspects of the problem from its purely geometrical ones. This separation is embedded in the data... |

453 | Computational Geometry
- Preparata, Shamos
- 1985
(Show Context)
Citation Context ...zling questions of computational geometry: Does the knowledge of a simple path between n points allow us to break the ~2(nlogn) lower bound on the time for computing any triangulation of these points =-=[6]-=-? The answer to this question is not yet known, but a number of O(nlogn) time algorithms have already been proposed to triangulate a simple n-sided polygon [1, 2, 4]. In this paper we propose to exten... |

194 |
The Art of Computer Programming: Sorting and Searching
- Knuth
- 1975
(Show Context)
Citation Context ...imal alphabetic binary tree constructed by the Hu-Tucker algorithm. Computing the optimal tree requires O(k log k) time and O(k) space, which leads to an added merge time of O(Y~l<_i<_k wi log(n/wi)) =-=[5]-=-. By elementary calculus, this quantity is shown to be O(n log k) time, which completes the proof. [] 6. CODING UP THE ALGORITHM We mention a few details concerning the implementation of the algorithm... |

75 |
A Theorem on Polygon Cutting with Applications
- Chazelle
- 1982
(Show Context)
Citation Context ...puting any triangulation of these points [6]? The answer to this question is not yet known, but a number of O(nlogn) time algorithms have already been proposed to triangulate a simple n-sided polygon =-=[1, 2, 4]-=-. In this paper we propose to extend our current knowledge of the problem by describing a new algorithm which, in many aspects, outperforms all known methods. Before presenting ihe main features of th... |

65 |
Triangulating a Simple Polygon
- Garey, Johnson, et al.
- 1978
(Show Context)
Citation Context ...puting any triangulation of these points [6]? The answer to this question is not yet known, but a number of O(nlogn) time algorithms have already been proposed to triangulate a simple n-sided polygon =-=[1, 2, 4]-=-. In this paper we propose to extend our current knowledge of the problem by describing a new algorithm which, in many aspects, outperforms all known methods. Before presenting ihe main features of th... |

48 |
Pattern recognition and geometrical complexity, in
- Toussaint
- 1980
(Show Context)
Citation Context ...tems General Terms: Algorithms, Computational Geometry Additional Key Words and Phrases: Divide-and-conquer, shape-complexity, triangulation 1. INTRODUCTION Triangulation problems are many and varied =-=[8]-=-. One common thread between them is the attempt to refine the notion of neighborhood among the objects under consideration. This is quite apparent in the case of polygonal triangulations, where one is... |

38 |
Fast triangulation of simple polygons
- Hertel, Mehlhorn
- 1983
(Show Context)
Citation Context ...puting any triangulation of these points [6]? The answer to this question is not yet known, but a number of O(nlogn) time algorithms have already been proposed to triangulate a simple n-sided polygon =-=[1, 2, 4]-=-. In this paper we propose to extend our current knowledge of the problem by describing a new algorithm which, in many aspects, outperforms all known methods. Before presenting ihe main features of th... |

16 |
On a convex hull algorithm for polygons and its application to triangulation problems, Pattem Recognition Lett. 15 (l
- Toussaint, Avis
- 1982
(Show Context)
Citation Context ...nting ihe main features of the algorithm, let us sumn.~arize the most important previously obtained results. Linear-time triangulations of special classes of polygons were found by Toussaint and Avis =-=[9]-=-, and Schoone and van Leeuwen [7]. In the first case, the class contained the so-called edge visible and monotone separable polygons, and in the latter, the star-shaped polygons. Garey et al. [2] also... |

3 |
Triangulating a starshaped polygon
- Schoone, Leeuwen
- 1980
(Show Context)
Citation Context ...gorithm, let us sumn.~arize the most important previously obtained results. Linear-time triangulations of special classes of polygons were found by Toussaint and Avis [9], and Schoone and van Leeuwen =-=[7]-=-. In the first case, the class contained the so-called edge visible and monotone separable polygons, and in the latter, the star-shaped polygons. Garey et al. [2] also gave a linear algorithm for mono... |