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

A Small Aperiodic Set of Planar Tiles

โœ Scribed by Chaim Goodman-Strauss

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
259 KB
Volume
20
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A small aperiodic set of Wang tiles
A small aperiodic set of Wang tiles
โœ Jarkko Kari ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB
Partitions of planar sets into small tri
Partitions of planar sets into small triangles
โœ Andrew M Odlyzko; Jรกnos Pintz; Kenneth B Stolarsky ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 440 KB

Given 3n points in the unit square, n >12, they determine n triangles whose vertices exhaust the given 3n points in many ways. Choose the n triangles so that the sum of their areas is minimal, and let a\*(n) be the maximum value of this minimum over all configurations of 3n points. Then n-~<< a\*(n)

The santalo point of a planar convex set
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)

Off-line dynamic maintenance of the widt
Off-line dynamic maintenance of the width of a planar point set
โœ Pankaj K. Agarwal; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 967 KB

In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence X = (a,, , a,,) of n insert and delete operations on a set S of points in R2, initially consisting