How ?-skeletons lose their edges
A ?-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter ?. Two nodes in a ?-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of ? some edges a skeleton are disappear. We study how a number of edges in ?-skeleton depends on ?. We speculate how this dependence can be used to discriminate between random and non-random planar sets. We also analyse stability of ?-skeletons and their sensitivity to perturbations.
?-skeletons proximity graph discrimination pattern formation