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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.