Partitioning a Polygonal Region into a Minimum Number of Triangles

Tetsuo ASANO; Takao ASANO; Yoshikazu OHSUGA

Copy

Tetsuo ASANO, Takao ASANO, Yoshikazu OHSUGA, "Partitioning a Polygonal Region into a Minimum Number of Triangles" in IEICE TRANSACTIONS on transactions, vol. E67-E, no. 4, pp. 232-233, April 1984, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e67-e_4_232/_p

Copy

@ARTICLE{e67-e_4_232,
author={Tetsuo ASANO, Takao ASANO, Yoshikazu OHSUGA, },
journal={IEICE TRANSACTIONS on transactions},
title={Partitioning a Polygonal Region into a Minimum Number of Triangles},
year={1984},
volume={E67-E},
number={4},
pages={232-233},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Partitioning a Polygonal Region into a Minimum Number of Triangles
T2 - IEICE TRANSACTIONS on transactions
SP - 232
EP - 233
AU - Tetsuo ASANO
AU - Takao ASANO
AU - Yoshikazu OHSUGA
PY - 1984
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E67-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1984
AB - 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.
ER -