For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Partitioning a Polygonal Region into a Minimum Number of Triangles
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1984/04/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Computational Complexity
Full Text: PDF(142.7KB)>>
We present a simple approximation algorithm for a problem of partitioning a polygonal region into a minimum number of triangles. The objective is to show that the absolute performance ratio of the algorithm is bounded by some constant for any polygonal region.