On growing connected beta-skeletons
Computational Geometry
2013-04-09 v1 Pattern Formation and Solitons
Abstract
A -skeleton, , is a planar proximity undirected graph of an Euclidean points set, where nodes are connected by an edge if their lune-based neighbourhood contains no other points of the given set. Parameter determines the size and shape of the lune-based neighbourhood. A -skeleton of a random planar set is usually a disconnected graph for . With the increase of , the number of edges in the -skeleton of a random graph decreases. We show how to grow stable -skeletons, which are connected for any given value of and characterise morphological transformations of the skeletons governed by and a degree of approximation. We speculate how the results obtained can be applied in biology and chemistry.
Cite
@article{arxiv.1304.1986,
title = {On growing connected beta-skeletons},
author = {Andrew Adamatzky},
journal= {arXiv preprint arXiv:1304.1986},
year = {2013}
}