Triangulating a region between arbitrary polygons

1Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

Abstract

The paper presents an optimal algorithm for triangulating a region between arbitrary polygons on the plane with time complexity O(N log N). An efficient algorithm is received by reducing the problem to the triangulation of simple polygons with holes. A simple polygon with holes is triangulated using the method of monotone chains and keeping overall design of the algorithm simple. The problem is solved in two stages. In the first stage a convex hull for m polygons is constructed by Graham's method. As a result, a simple polygon with holes is received. Thus, the problem of triangulating a region between arbitrary polygons is reduced to the triangulation of a simple polygon with holes. In the next stage the simple polygon with holes is triangulated using an approach based on procedure of splitting polygon onto monotone polygons using the method of chains [15]. An efficient triangulating algorithm is received. The proposed algorithm is characterized by a very simple implementation, and the elements (triangles) of the resulting triangulation can be presented in the form of simple and fast data structure: a tree of triangles [17].

Cite

CITATION STYLE

APA

Tereshchenko, V., & Tereshchenko, Y. (2017). Triangulating a region between arbitrary polygons. International Journal of Computing, 16(3), 160–165. https://doi.org/10.47839/ijc.16.3.899

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free