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

On the Partitions of a Polygon

โœ Scribed by Cayley,


Book ID
120105255
Publisher
Oxford University Press
Year
1890
Tongue
English
Weight
706 KB
Volume
s1-22
Category
Article
ISSN
0024-6115

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On a partition into convex polygons
โœ Masatsugu Urabe ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 698 KB
Minimum K-partitioning of rectilinear po
โœ Oliver Gunther ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 941 KB

A minimum k-partition decomposes a rectilinear polygon with n vertices into a minimum number of disjoint rectilinear components with no more than k vertices each (k < n). First, we derive a new lower bound for the number of components in a kpartition. Then we present algorithms to compute minimum k-