Existence, uniqueness, and algorithmic computation of general lilypond systems
From MaRDI portal
Publication:3419598
DOI10.1002/rsa.20099zbMath1220.60008MaRDI 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
existence; uniqueness; Euclidean space; examples; unit speed; pseudometric space; algorithmc computation; lilypond system
60D05: Geometric probability and stochastic geometry
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)
Related Items
Percolation and limit theory for the poisson lilypond model, On a Class of Growth-Maximal Hardcore Processes, Descending chains, the lilypond model, and mutual-nearest-neighbour matching, Stationary Apollonian packings, Optimal stationary markings, Iterated Gilbert mosaics, A percolating hard sphere model