領域の最適三角形群への分割アルゴリズム
スポンサーリンク
概要
- 論文の詳細を見る
An algorithm is presented for partitioning a domain into a suitable family of triangularplates, of which vertices consist of given points arbitrarily distributed in a plane. The family of so obtained triangular plates is uniquely determined by the algorithm except for "singular domains", and this triangulation is proved to be optimum is the sense that the minimum angle of the so determined triangular plates is larger than the minimum angle of the triangular plates obtained by any other algorithm for triangulation. It is also proved that the dual partition can be introduced which divides the whole plane into the family of dual polygons. The present algorithm treats two dimesional cases, but It is easily extended to any higher dimensional cases.
- 一般社団法人情報処理学会の論文
- 1978-03-15