Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets

McCabe, Paul

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学位論文

Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets

MPS-Authors

/persons/resource/persons44958

McCabe, Paul
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

McCabe, P. (2003). Lower Bounding the Number of Straight-Edge Triangulations of Planar Point Sets. Master Thesis, Universität des Saarlandes, Saarbrücken.

引用: https://hdl.handle.net/11858/00-001M-0000-0027-F823-4

要旨

We examine the number of triangulations that any set of n points in the plane must have, and prove that (i) any set of n points has at least 0.00037*2.2n triangulations, (ii) any set with three extreme points and n interior points has at least 0.112*2.569n triangulation, and (iii) any set with n interior points has at least 0.238 * 2.38n triangulation. The best previously known lower bound for the number of triangulations for n points in the plane is 0.0822 * 2.0129n. We also give a method of automatically extending known bounds for small point sets to general lower bounds.