Existence, uniqueness, and algorithmic computation of general lilypond systems

DOI10.1002/rsa.20099zbMath1220.60008OpenAlexW4237095459MaRDI QIDQ3419598

Matthias Heveling, Günter Last

Publication date: 7 February 2007

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20099

zbMATH Keywords

existenceuniquenessEuclidean spaceexamplesunit speedpseudometric spacealgorithmc computationlilypond system

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items

Iterated Gilbert mosaics ⋮ Stationary Apollonian packings ⋮ Descending chains, the lilypond model, and mutual-nearest-neighbour matching ⋮ Percolation and limit theory for the poisson lilypond model ⋮ Optimal stationary markings ⋮ A percolating hard sphere model ⋮ On a Class of Growth-Maximal Hardcore Processes