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

On the number of rectangulations of a planar point set

โœ Scribed by Eyal Ackerman; Gill Barequet; Ron Y. Pinter


Book ID
118475160
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
227 KB
Volume
113
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The santalo point of a planar convex set
โœ M.J. Kaiser ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)