๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An O(n) algorithm to find a near-optimum partition of a convex polygon

โœ Scribed by T.C Hu; M.T Shing

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
673 KB
Volume
2
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An O(n log n)-algorithm for fi
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded
โœ Nicolas Thiant ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 702 KB

We consider the problem of tiling a plane picture with dominoes, this picture can be with holes or without holes. We give a necessary and su cient condition for the existence of such a tiling and then we deduce an algorithm to decide whether a picture is tileable or not and if it is, to determine a