disk packing
Recently Published Documents


TOTAL DOCUMENTS

23
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

2020 ◽  
Vol 375 ◽  
pp. 125076 ◽  
Author(s):  
Joonghyun Ryu ◽  
Mokwon Lee ◽  
Donguk Kim ◽  
Josef Kallrath ◽  
Kokichi Sugihara ◽  
...  

2016 ◽  
Vol 85 (4) ◽  
Author(s):  
Stéphane Douady ◽  
Christophe Golé

Historically, the study of phyllotaxis was greatly helped by the simple description of botanical patterns by only two integer numbers, namely the number of helices (parastichies) in each direction tiling the plant stem. The use of parastichy numbers reduced the complexity of the study and created a proliferation of generalizations, among others the simple geometric model of lattices. Unfortunately, these simple descriptive method runs into difficulties when dealing with patterns presenting transitions or irregularities. Here, we propose several ways of addressing the imperfections of botanical reality. Using ontogenetic analysis, which follows the step-by-step genesis of the pattern, and crystallographic analysis, which reveal irregularity in its details, we show how to derive more information from a real botanical sample, in particular, about its irregularities and transitions. We present several examples, from the first explicit visualization of a normal Fibonacci parastichy number increase, to more exotic ones, including the quasi-symmetric patterns detected in simulations. We compare these observations qualitatively with the result of the disk-packing model, presenting evidence for the relevance of the model.


2015 ◽  
Vol 1 (1) ◽  
pp. 17-26 ◽  
Author(s):  
Guanghui Liang ◽  
Lin Lu ◽  
Zhonggui Chen ◽  
Chenglei Yang

Soft Matter ◽  
2014 ◽  
Vol 10 (1) ◽  
pp. 109-114 ◽  
Author(s):  
Ling Zhang ◽  
Shuxiao Cai ◽  
Zunpeng Hu ◽  
Jie Zhang
Keyword(s):  

2010 ◽  
Vol 20 (03) ◽  
pp. 341-360 ◽  
Author(s):  
PETER BRASS ◽  
FERRAN HURTADO ◽  
BENJAMIN LAFRENIERE ◽  
ANNA LUBIW

Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Rado conjectured 1/4 and proved 1/4.41. Motivated by the problem of channel assignment for wireless access points, in which use of 3 channels is a standard practice, we consider a variant where the selected subset of disks must be 3-colourable with disks of the same colour pairwise-disjoint. For this variant of the problem, we conjecture that it is always possible to cover at least 1/1.41 of the union area and prove 1/2.09. We also provide an O(n2) algorithm to select a subset achieving a 1/2.77 bound. Finally, we discuss some results for other numbers of colours.


2008 ◽  
Vol 20 (4) ◽  
pp. 516-524 ◽  
Author(s):  
B. Addis ◽  
M. Locatelli ◽  
F. Schoen

Sign in / Sign up

Export Citation Format

Share Document