Linear Time Triangulation of Simple Polygons
نویسنده
چکیده
From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several near-linear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual use despite their faster asymptotic running time. In this paper, I examine the latter of these in detail and attempt to implement it.
منابع مشابه
A Fast, Practical Algorithm for the
—A fast, practical, deterministic algorithm for the horizontal trapezoidation of simple polygons is presented. The polygon is decomposed into a minimal collection of trapezoid sequences, such that two trapezoids adjacent within a sequence always share a common horizontal border. Such trapezoid sequences are a convenient data structure in a display list for a collection of polygonal objects to...
متن کاملFast Triangulation of the Plane with Respect to Simple Polygons
Let P~,..., Pk be pairwise non-intersecting simple polygons with a total of n vertices and s start vertices. A start vertex, in general, is a vertex both of which neighbors have larger x coordinate. We present an algorithm for triangulating P~,..., Pk in time O(n + s log s). s may be viewed as a measure of non-convexity. In particular, s is always bounded by the number of concave angles + 1, an...
متن کاملA Simple Polygon Triangulation Algorithm
In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...
متن کاملTriangulating Simple Polygons: Pseudo-Triangulations
Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n − 2 triangles by adding n − 3 nonintersecting diagonals. Significant theoretical advances have recently been made in finding efficient polygon triangulation algorithms. However, there is substantial effort being made in finding a simple and practical triangulation algorithm. We propose the concep...
متن کاملConverting triangulations to quadrangulations
We study the problem of converting triangulated domains to quadrangulations, under a variety of constraints. We obtain a variety of characterizations for when a triangulation (of some structure such as a polygon, set of points, line segments or planar subdivision) admits a quadrangulation without the use of Steiner points, or with a bounded number of Steiner points. We also investigate the effe...
متن کامل