Results 301 to 310 of about 104,658 (327)

Tilings by Regular Polygons [PDF]

open access: possibleMathematics Magazine, 1977
Patterns in the plane from Kepler to the present, including recent results and unsolved problems.
Branko Grünbaum, G. C. Shephard
openaire   +1 more source

Regular polygon detection

Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, 2005
This paper describes a new robust regular polygon detector. The regular polygon transform is posed as a mixture of regular polygons in a five dimensional space. Given the edge structure of an image, we derive the a posteriori probability for a mixture of regular polygons, and thus the probability density function for the appearance of a mixture of ...
G. Loy   +3 more
openaire   +2 more sources

The Inscription of Regular Polygons

The American Mathematical Monthly, 1894
(1894). The Inscription of Regular Polygons. The American Mathematical Monthly: Vol. 1, No. 10, pp. 342-345.
openaire   +2 more sources

Partitions of Regular Polygons

2021
A regular polygon, for example, a square, can be dissected in different ways by continued partition.
openaire   +2 more sources

The Cinderella of regular polygons

2017
Among the regular polygons, the regular heptagon most certainly is Cinderella. Contrary to a triangle, a square, a pentagon or a hexagon, the heptagon is not constructible using compass and straightedge methods. In what follows, we will guide you through the proof of this non-constructibility.
Ad Meskens, Paul Tytgat
openaire   +2 more sources

Regular Polygons and Stars

2021
Regular stars are created by connecting vertices of regular polygons according to a certain rule.
openaire   +2 more sources

Loops of Regular Polygons

The American Mathematical Monthly, 2000
(2000). Loops of Regular Polygons. The American Mathematical Monthly: Vol. 107, No. 6, pp. 500-510.
openaire   +2 more sources

A Note on Regular Near Polygons

Graphs and Combinatorics, 2004
Let Γ be a regular near polygon of order (s,t) with s>1 and t≥3. Let d be the diameter of Γ, and let r:= max{i∣(ci,ai,bi)=(c1,a1,b1)}. In this note we prove several inequalities for Γ. In particular, we show that s is bounded from above by function in t if **. We also consider regular near polygons of order (s,3).
Hiraki, A, Koolen, J
openaire   +3 more sources

Electronic patient‐reported outcome systems in oncology clinical practice

Ca-A Cancer Journal for Clinicians, 2012
Antonia V Bennett, Ethan Basch
exaly  

Home - About - Disclaimer - Privacy