The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Modeling and visualization of leaf venation patterns
ACM SIGGRAPH 2005 Papers
On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Bioevaluation of World Transport Networks
Bioevaluation of World Transport Networks
| Hi-index | 0.07 |
A @b-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter @b. Two nodes in a @b-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With increase of @b some edges a skeleton are disappear. We study how a number of edges in @b-skeleton depends on @b. We speculate how this dependence can be used to discriminate between random and non-random planar sets. We also analyse stability of @b-skeletons and their sensitivity to perturbations.