How -skeletons lose their edges
From MaRDI portal
Publication:497919
DOI10.1016/J.INS.2013.07.022zbMATH Open1353.05088arXiv1312.7363OpenAlexW2062806949MaRDI QIDQ497919FDOQ497919
Authors: Andrew Adamatzky
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Abstract: A {�eta}-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter {�eta}. Two nodes in a {�eta}-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of {�eta} some edges a skeleton are disappear. We study how a number of edges in {�eta}-skeleton depends on {�eta}. We speculate how this dependence can be used to discriminate between random and non-random planar sets. We also analyse stability of {�eta}-skeletons and their sensitivity to perturbations.
Full work available at URL: https://arxiv.org/abs/1312.7363
Recommendations
- On growing connected \(\beta \)-skeletons
- \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
- Output-sensitive algorithm for computing \(\beta\)-skeletons
- Fast algorithms for computing \(\beta\)-skeletons and their relatives.
- New sequential and parallel algorithms for computing the \(\beta \)-spectrum
Cites Work
Cited In (4)
This page was built for publication: How \({\beta}\)-skeletons lose their edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497919)