𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A computational algorithm for optimally covering a plane region

✍ Scribed by V.S. Brusov; S.A. Piyavskii

Publisher
Elsevier Science
Year
1971
Weight
668 KB
Volume
11
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A covering problem for plane lattices
A covering problem for plane lattices
✍ Salvatore Vassallo πŸ“‚ Article πŸ“… 1992 πŸ› Springer 🌐 English βš– 491 KB

Let &a be a plane lattice and {vl, v2} a Minkowski reduced base of ~. In this note we prove that ifa convex body X has minimal width w(X')/> Iv2[ sin ~p + Ivll(x/3/2), where ~o is the acute angle between vl and v2, then X" is a covering set for ~.