O ukladaní kociek a iných objektov
Uvedieme históriu a prehľad výsledkov o ukladaní kociek do kvádra s minimálnym objemom a pridáme aj hlavné myšlienky niektorých dôkazov. V závere sa veľmi stručne zmienime o iných ukladacích problémoch.
Page 1 Next
Displaying 1 – 20 of 21
On a covering problem for equilateral triangles.
Dumitrescu, Adrian, Jiang, Minghui (2008)
The Electronic Journal of Combinatorics [electronic only]
On a geometrical interpretation of a sampling.
Szalay, László, Temesvári, Ágota H. (1994)
Beiträge zur Algebra und Geometrie
On Convex Bodies that Permit Packings of High Density.
H. Groemer (1990)
Discrete & computational geometry
On coverings with convex domains
R. Bambah, C. Rogers, H. Zassenhaus (1964)
Acta Arithmetica
On geodesics of phyllotaxis
Roland Bacher (2014)
Confluentes Mathematici
Seeds of sunflowers are often modelled by leading to a roughly uniform repartition with seeds indexed by consecutive integers at angular distance for the golden ratio. We associate to such a map a geodesic path of the modular curve and use it for local descriptions of the image of the phyllotactic map .
On Gnomons
Jan M. Aarts, Robbert. J. Fokkink (2003)
Matematički Vesnik
On packing of squares into a rectangle
Pavel Novotný (1996)
Archivum Mathematicum
On parametric density of finite circle packings.
Schürmann, Achill (2000)
Beiträge zur Algebra und Geometrie
On seven points in the boundary of a plane convex body in large relative distances.
Lángi, Zsolt (2004)
Beiträge zur Algebra und Geometrie
On some packings of the hyperbolic plane by incongruent hypercyclic domains.
Vermes, Imre (1993)
Beiträge zur Algebra und Geometrie
On the area discrepancy of triangulations of squares and trapezoids.
Schulze, Bernd (2011)
The Electronic Journal of Combinatorics [electronic only]
On the cover time of planar graphs.
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
On the Hadwiger numbers of centrally symmetric starlike disks.
Lángi, Zsot (2009)
Beiträge zur Algebra und Geometrie
On the lower bound of packing density for convex bodies in the plane.
Doheny, Kevin R. (1995)
Beiträge zur Algebra und Geometrie
On the perimeter of the intersection of congruent disks.
Bezdek, Károly, Connelly, Robert, Csikós, Balázs (2006)
Beiträge zur Algebra und Geometrie
On the thinnest 2-fold double-lattice covering with a centrally symmetric convex domain. (Über die dünnste doppelgitterförmige 2-fache Überdeckung mit einem zentralsymmetrischen konvexen Bereich.)
Temesvári, Ágota H. (1994)
Beiträge zur Algebra und Geometrie
On-line Covering the Unit Square with Squares
Janusz Januszewski (2009)
Bulletin of the Polish Academy of Sciences. Mathematics
The unit square can be on-line covered with any sequence of squares whose total area is not smaller than 4.
On-line Packing Squares into n Unit Squares
Janusz Januszewski (2010)
Bulletin of the Polish Academy of Sciences. Mathematics
If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.
Optimal packings for filled rings of circles
Dinesh B. Ekanayake, Manjula Mahesh Ranpatidewage, Douglas J. LaFountain (2020)
Applications of Mathematics
General circle packings are arrangements of circles on a given surface such that no two circles overlap except at tangent points. In this paper, we examine the optimal arrangement of circles centered on concentric annuli, in what we term rings. Our motivation for this is two-fold: first, certain industrial applications of circle packing naturally allow for filled rings of circles; second, any packing of circles within a circle admits a ring structure if one allows for irregular spacing of circles...
Currently displaying 1 – 20 of 21
Page 1 Next