Space-time generation of high intensity patterns using growth-interaction processes

E. Renshaw, C. Comas

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We describe a novel spatial-temporal algorithm for generating packing structures of disks and spheres, which not only incorporates all the attractive features of existing algorithms but is also more flexible in defining spatial interactions and other control parameters. The advantage of this approach lies in the ability of marks to exploit to best advantage the space available to them by changing their size in response to the interaction pressure of their neighbours. Allowing particles to move in response to such pressure results in high-intensity packing. Indeed, since particles may temporarily overlap, even under hard-packing scenarios, they possess a greater potential for rearranging themselves, and thereby creating even higher packing intensities than exist under other strategies. Non-overlapping pattern structures are achieved simply by allowing the process to 'burn-out' at the end of its development period. A variety of different growth-interaction regimes are explored, both symmetric and asymmetric, and the convergence issues that they raise are examined. We conjecture that not only may this algorithm be easily generalised to cover a large variety of situations across a wide range of disciplines, but that appropriately targeted generalisations may well include established packing algorithms as special cases.
LanguageEnglish
Pages423-437
Number of pages14
JournalStatistics and Computing
Volume19
Issue number4
DOIs
Publication statusPublished - Dec 2009

Fingerprint

Packing
Space-time
Interaction
Control Parameter
Overlap
Cover
Scenarios
Range of data

Keywords

  • granular materials
  • growth-interaction processes
  • pattern formation
  • random packings
  • simulation

Cite this

@article{760ff48519bb4d9b822c69a4953793f2,
title = "Space-time generation of high intensity patterns using growth-interaction processes",
abstract = "We describe a novel spatial-temporal algorithm for generating packing structures of disks and spheres, which not only incorporates all the attractive features of existing algorithms but is also more flexible in defining spatial interactions and other control parameters. The advantage of this approach lies in the ability of marks to exploit to best advantage the space available to them by changing their size in response to the interaction pressure of their neighbours. Allowing particles to move in response to such pressure results in high-intensity packing. Indeed, since particles may temporarily overlap, even under hard-packing scenarios, they possess a greater potential for rearranging themselves, and thereby creating even higher packing intensities than exist under other strategies. Non-overlapping pattern structures are achieved simply by allowing the process to 'burn-out' at the end of its development period. A variety of different growth-interaction regimes are explored, both symmetric and asymmetric, and the convergence issues that they raise are examined. We conjecture that not only may this algorithm be easily generalised to cover a large variety of situations across a wide range of disciplines, but that appropriately targeted generalisations may well include established packing algorithms as special cases.",
keywords = "granular materials, growth-interaction processes, pattern formation, random packings, simulation",
author = "E. Renshaw and C. Comas",
year = "2009",
month = "12",
doi = "10.1007/s11222-008-9102-y",
language = "English",
volume = "19",
pages = "423--437",
journal = "Statistics and Computing",
issn = "0960-3174",
number = "4",

}

Space-time generation of high intensity patterns using growth-interaction processes. / Renshaw, E.; Comas, C.

In: Statistics and Computing, Vol. 19, No. 4, 12.2009, p. 423-437.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Space-time generation of high intensity patterns using growth-interaction processes

AU - Renshaw, E.

AU - Comas, C.

PY - 2009/12

Y1 - 2009/12

N2 - We describe a novel spatial-temporal algorithm for generating packing structures of disks and spheres, which not only incorporates all the attractive features of existing algorithms but is also more flexible in defining spatial interactions and other control parameters. The advantage of this approach lies in the ability of marks to exploit to best advantage the space available to them by changing their size in response to the interaction pressure of their neighbours. Allowing particles to move in response to such pressure results in high-intensity packing. Indeed, since particles may temporarily overlap, even under hard-packing scenarios, they possess a greater potential for rearranging themselves, and thereby creating even higher packing intensities than exist under other strategies. Non-overlapping pattern structures are achieved simply by allowing the process to 'burn-out' at the end of its development period. A variety of different growth-interaction regimes are explored, both symmetric and asymmetric, and the convergence issues that they raise are examined. We conjecture that not only may this algorithm be easily generalised to cover a large variety of situations across a wide range of disciplines, but that appropriately targeted generalisations may well include established packing algorithms as special cases.

AB - We describe a novel spatial-temporal algorithm for generating packing structures of disks and spheres, which not only incorporates all the attractive features of existing algorithms but is also more flexible in defining spatial interactions and other control parameters. The advantage of this approach lies in the ability of marks to exploit to best advantage the space available to them by changing their size in response to the interaction pressure of their neighbours. Allowing particles to move in response to such pressure results in high-intensity packing. Indeed, since particles may temporarily overlap, even under hard-packing scenarios, they possess a greater potential for rearranging themselves, and thereby creating even higher packing intensities than exist under other strategies. Non-overlapping pattern structures are achieved simply by allowing the process to 'burn-out' at the end of its development period. A variety of different growth-interaction regimes are explored, both symmetric and asymmetric, and the convergence issues that they raise are examined. We conjecture that not only may this algorithm be easily generalised to cover a large variety of situations across a wide range of disciplines, but that appropriately targeted generalisations may well include established packing algorithms as special cases.

KW - granular materials

KW - growth-interaction processes

KW - pattern formation

KW - random packings

KW - simulation

UR - http://dx.doi.org/10.1007/s11222-008-9102-y

U2 - 10.1007/s11222-008-9102-y

DO - 10.1007/s11222-008-9102-y

M3 - Article

VL - 19

SP - 423

EP - 437

JO - Statistics and Computing

T2 - Statistics and Computing

JF - Statistics and Computing

SN - 0960-3174

IS - 4

ER -