# How -skeletons lose their edges

###### Abstract

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.

Keywords: proximity graphs, -skeletons, pattern formation, discrimination

## 1 Introduction

A planar graph consists of nodes which are points of Euclidean plane and edges which are straight segments connecting the points. A planar proximity graph is a planar graph where two points are connected by an edge if they are close in some sense. Usually a pair of points is assigned certain neighbourhood, and points of the pair are connected by an edge if their neighbourhood is empty. Delaunay triangulation [10], relative neighbourhood graph [12] and Gabriel graph [18], and indeed spanning tree, are most known examples of proximity graphs.

-skeletons [14] is a unique family of proximity graphs monotonously parameterised by . Two neighbouring points of a planar set are connected by an edge in -skeleton if a lune-shaped domain between the points contains no other points of the planar set. Size and shape of the lune is governed by .

Why is it necessary to study properties of -skeletons? The -skeletons are eminent representatives of the family of proximity graphs. Proximity graphs found their applications in fields of science and engineerings: image processing and computational morphology: e.g. curve reconstruction from a set of planar points [4], approximation of road networks [27, 28], geographical variational analysis [11, 18, 22], evolutionary biology [17], spatial analysis in biology [15, 8, 9, 13], simulation of epidemics [25]. Proximity graphs are used in physics to study percolation [6] and analysis of magnetic field [24]. Engineering applications of proximity graphs are in message routing in ad hoc wireless networks, see e.g. [16, 23, 21, 19, 26], and visualisation [20]. Road network analysis is yet another field where proximity graphs are invaluable. Road networks are well matched by relative neighborhbood graphs, see e.g. study of Tsukuba central district [27, 28]. Biological transport networks also bear remarkable similarity to certain proximity graphs. Foraging trails of ants and protoplasmic networks of slime mold Physarum polycephalum [1, 2] are most striking examples.

In our previous works on approximation of man-made road networks with slime mould and proximity graphs [2] we found that -skeletons provides sufficiently good approximation of highway network in many countries for lying between 1 and 2 (Fig. 1ab). A -skeleton, in general case, becomes disconnected for and continues losing its edges with further increase of (Fig. 1c–l). Are sections of road networks, which survive longer with increasing bear any particular importance? We did find, see details in [2, 3], that by tuning value of we can, in principle, make a difference between paved and unpaved roads in Trans-African highway network, however an ideal matching between a -skeleton and a high-way graph was every achieved. Thus we got engaged with studies of dynamics of -skeletons. Some finding we made so far are outlined in present paper. We answer the following questions. How a rate of edge disappearance depends on ? For what configurations of planar points -skeleton does not lose its edges with increase of ? Can we differentiate between random and non-random configurations of planar points by a curve of their -driven edge disappearance?

## 2 -skeletons

Given a set of planar points, for any two points and we define -neighbourhood as an intersection of two discs with radius centered at points and , [14, 12], see examples of the lunes in Fig. 2. Points and are connected by an edge in -skeleton if the pair’s -neighbourhood contains no other points from .

## 3 Edges losses in skeleton on random planar sets

To analyse rate of edge losses in -skeletons of random planar sets we represented planar points by discs, centres of the discs form set . Each disc has a radius 2.5 units and the discs are randomly distributed in a large disc with radius 250 (Fig. 3). For up to 2500 and varying from 1 to 50 we calculated number of edges in -skeletons (Fig. 3b–h). Example curves are shown in Fig. 3i. Data points are approximated by power curve .

###### Finding 1

-skeletons of random planar sets lose their edges by power law. Number decreases proportionally to , . Absolute value of is linearly proportional to number of planar points in the sets.

To uncover how and depends on we approximated for planar sets and . Data points calculated are shown in Fig. 4.

## 4 Differentiating between random and non-random sets

In previous section we demonstrated that presence of even minor impurities in originally regular arrangement of planar points can be detected directly in the shape of edge disappearance curve . This leads us to the following hypothesis.

###### Hypothesis 1

Random planar sets can be differentiated from non-random sets by a shape of edge disappearance curve .

We do not aim to prove the hypothesis in present paper but rather demonstrate its viability in two examples. We represented drawings of a face and a horseman and in sets of planar points (Figs. 5a and 6a). Evolution of -skeletons of these sets, associated with removal of certain edges of -skeletons, leads to formation of contour like representations of the images (Figs. 5 and 6). We calculated edge disappearance curves for fixed and changing from 1.0 to 50 with increment 0.1 (Fig. 7, dashed line and dash-dots line). We also produced curves for random sets of planar points, with the same numbers of points, distributed in a disc radius 250 units (Fig. 7, solid line and dotted line).

Planar set | |||
---|---|---|---|

Face | 823 | 1797.9 | -0.296 |

Random set | 823 | 10078.9 | -0.73 |

Horseman | 351 | 1077.8 | -0.306 |

Random set | 351 | 2159.0 | -0.5344 |

The data are approximated by power regression with coefficients shown in Tab 1. The coefficients were calculated using a non-linear least square technique using Gauss-Newton algorithm [7].

Based on Fig. 7 and Tab. 1 we can conclude that random planar sets have initially higher number of edges than non-random sets however they exhibit higher rate of edge disappearance driven by . For a number of edges in the skeleton of face is 0.72 of edges comparing to ta number of edges in a skeleton of a random planar set with the same number of points; and skeleton of horseman has 0.79 of edges of its corresponding random set. The skeletons of non-random sets have almost the same number of edges as skeletons of random sets at (face) and (horseman). After that value of number of edges in skeletons of random sets decreases substantially quicker than number of edges of skeletons of non-random sets. Thus, at -skeleton of face has 4.68 times more edges than a skeleton of its corresponding random set, and skeleton of horseman has 2 times more edges than skeleton of a random set.

The two examples considered are not at all enough to make any rigorous conclusions, however we can speculate that the difference between random and non-random sets occurs when is changed from to (i.e. almost at the same time when skeletons are at first becoming disconnected); and, it is enough to compute -skeletons till because for such value of number of edges in skeletons of non-random sets 1.5 times higher than a number of edges in skeletons of random sets.

## 5 Stability and impurities

Not all -skeletons lose their edges with increase of . Special cases of stable -skeletons are discussed in present section. Let be an open half-plane bounded by an infinite straight line passing through , perpendicular to segment and containing ; and be an open half-plane bounded by an infinite straight line perpendicular to segment , passing through and containing . Let . When becomes extremely large, tends to infinity, a -neigbourhood of any two neighbouring points and tends to . A -skeleton of planar set is stable if for any does not contain any points from apart of and . A stable -skeleton retains its edges for any value of .

A most obvious example of a stable -skeleton is a skeleton built on a set of planar points arranged in a rectangular array. The rectangular -skeleton conserves its edges for any value of (Fig. 8). The rectangular attice is stable because for any two neighbouring nodes and intersection of their half-planes fits between rows or columns of nodes without covering any nodes.

###### Finding 2

Regularity does not guarantee stability.

In Fig. 9 we show skeletons of a hexagonal arrangement of planar points (Fig. 9a). A skeleton is a hexagonal lattice for (Fig. 9b). All diagonal edges of the lattice disappear when (Fig. 9c). With further increase of to 3 horizontal edges vanish (Fig. 9d) and all nodes of the original planar set become isolated.

###### Finding 3

Stable -skeletons are sensitive to perturbations.

Stable -skeletons are sensitive to even slight distortions of a regular arrangement of elements . This is illustrated in Fig. 10. One node in the otherwise perfect uniform and regular rectangular array of planar points (Fig. 10a) gets its coordinates slightly randomised, so its coordinate is different from other nodes in its row, and its coordinate is different from other nodes in its column. A localised distortion of the skeleton can be seen in edges linking node in 5th column and 4th row with its four neighbours (Fig. 10b). With increase of the ’defective’ node starts losing its edges (Fig. 10c). With further increase of the defect induced edge elimination propagates along row and columns adjacent to the defective node (Fig. 10d–g). Eventually a value of reached where no more edges are removed and the skeleton remains stable under subsequent growth of (Fig. 10h).

When regular -skeletons are ’dissolved’ by increasing order of an edge disappearance is determined by the edge location. In Fig. 11a we consider a planar set which core nodes are arranged in a spiral and other nodes lined up in rays. The planar set is spanned by spider-web looking -skeleton for (Fig. 11b). The spiral part of the skeleton retracts back towards its centre when increases from 1 to 4 (Fig. 11cde). At the value only nodes which where originally in the spiral shape (two rotations) and nodes aligned in rays are connected by edges of the -skeleton (Fig. 11f). Further increase of causes retraction of the original spiral and dilution of rays, with edges disappearing centrifugally (Fig. 11g–l).

###### Finding 4

Presence of impurities in otherwise regular arrangements can be detected by edge disappearance curve .

Let us consider a planar set where points are arranged into six nested circles all centred at the same point (Figs. 12a). When the skeleton has the following structure: every point in circle is connected by an edge to its two immediate neighbours in its circle, and to two neighbours in the circle included in (if there is a circle included in ) and two neighbours in the circle which includes (if there is a circle including ), see Figs. 12b. Increase of from 1 to 11 leads to disappearance of edges connecting points in different circles (Figs. 12c–k). These edges disappear centrifugally. With further increase of we observe removal of edges linking nodes in the same circles, see e.g. (Figs. 12c–k).

Let us introduce a minor impurity: we make centres of circles slightly deviating, at random in a range units along each axis, around centre (Figs. 13a). With increase of the skeleton of such an arrangement of points loses majority of edges between different circles when reaches (Figs. 13b–g). Few remaining edges are removed by (Figs. 13h–k). Edges connecting points inside circles disappear for larger values of , see e.g. (Figs. 13l).

Edge disappearance curves , , for the -skeletons of the cyclic arrangements are shown in Fig. 14. For comparison we also added for six nested circles with the same centre where position of each point is randomised in interval along each axis.

The curve for circular arrangement of points with the same centre has a pronounced staircase like structure (Fig. 14, solid line). The first sequence of low-height stairs is observed for : this corresponds to removal of edges connecting points lying in different cycles. The second sequence of stairs, reflects removal of edges linking neighbouring points lying in the same cycles. Curves , calculated for circular arrangement of points with randomised centres and circles with randomised positions of nodes, show gradual decline in number of edges.

## 6 Conclusion

Most -skeletons lose their edges with increase of . The skeletons of random planar sets lose edges by power low with rate of edge disappearance proportional to a number of points in the sets. Some -skeletons conserve their edges for any as large as it could be. These are usually skeletons built on a regularly arranged points of planar sets. We found that even minuscule impurity in the regular arrangement of points leads to propagation of edge loss wave across the otherwise stable skeleton. This indicates that presence of random components in a planar set may lead to a higher rate of -driven edge disappearance. By comparing edge disappearance curves of non-random and random planar sets (with the same number of nodes) we found that -skeletons of random sets have larger number of edges for small values of (up to ) yet exhibit higher rate of edge loss. In examples studied skeletons of random sets lose their edges 1.5-2.5 times faster than skeletons of non-random set. For large values of () a number of edges in -skeletons of non-random planar sets is over twice a number of edges in random sets. We hypothesise that by subjecting a -skeleton of a planar set to -driven edge removal we can discriminate between random and non-random sets. To prove the hypothesis and make the approach applicable to image classification we must collect statistics form much larger number of non-random planar sets. This will be a topic of further studies.

## References

- [1] Adamatzky A. Developing proximity graphs by Physarum Polycephalum: Does the plasmodium follow Toussaint hierarchy? Parallel Processing Letters 19 (2008) 105–127.
- [2] Adamatzky A. (Ed.) Bioevaluation of World Transport Networks (World Scientific, 2012).
- [3] Adamatzky A. and Kayem A. Biological evaluation of Trans-African highways The European Physical Journal Special Topics 215 (1), 49–59.
- [4] Amenta N., Bern M., Eppstein D. The Crust and the -Skeleton: Combinatorial Curve Reconstruction. Graphical Models and Image Processing. 60 (1998) 125–135.
- [5] Beavon D. J. K., Brantingham P. L. and Brantingham P. J. The influence of street networks on the patterning of property offenses. www.popcenter.org/library/CrimePrevention/Volume_02/06beavon.pdf
- [6] Billiot J. M., Corset F., Fontenas E. Continuum percolation in the relative neighbourhood graph. arXiv:1004.5292
- [7] Björck A. Numerical methods for least squares problems. SIAM, 1996.
- [8] Dale M. R. T. Spatial Analysis in Plant Ecology (Cambridge University Press, 2000).
- [9] Dale M. R. T., Dixon P., Fortin M.-J., Legendre P., Myers D. E. and Rosenberg M. S. Conceptual and mathematical relationships among methods for spatial analysis. Ecography 25 (2002) 558-577.
- [10] Delaunay B. Sur la sphère vide, Izvestia Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk, 7 (1934) 793–800.
- [11] Gabriel K. R. and Sokal R. R. A new statistical approach to geographic variation analysis. Systematic Zoology 18 (1969) 259-270.
- [12] Jaromczyk J. W. and G. T. Toussaint, Relative neighborhood graphs and their relatives. Proc. IEEE 80 (1992) 1502–1517.
- [13] Jombart T., Devillard S., Dufour A.-B., Pontier D. Revelaing cryptic spatial patterns in genetic variability by a new multivariate method. Heredity 101 (2008) 92–103.
- [14] Kirkpatrick D.G. and Radke J.D. A framework for computational morphology. In: Toussaint G. T., Ed., Computational Geometry (North-Holland, 1985) 217-248.
- [15] Legendre P. and Fortin M.-J. Spatial pattern and ecological analysis. Vegetatio 80 (1989) 107–138.
- [16] Li X.-Y. Application of computation geometry in wireless networks. In: Cheng X., Huang X., Du D.-Z. (Eds.) Ad Hoc Wireless Networking (Kluwer Academic Publishers, 2004) 197–264.
- [17] Magwene P. W. Using correlation proximity graphs to study phenotypic integration. Evolutionary Biology. 35 (2008) 191–198.
- [18] Matula D. W. and Sokal R. R. Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane. Geogr. Anal. 12 (1980) 205-222.
- [19] Muhammad R. B. A distributed graph algorithm for geometric routing in ad hoc wireless networks. J Networks 2 (2007) 49–57.
- [Parry (2007)] Parry R. Map of Trans-African Highways based on data 2000 to 2003. (17 July 2007). http://upload.wikimedia.org/wikipedia/commons/0/03/Map_of_Trans-African_Highways.PNG
- [20] Runions A., Fuhrer M., Lane B., Federl P., Rolland-Lagan A.-G., and Prusinkiewicz P. Modeling and visualization of leaf venation patterns. ACM Transactions on Graphics 24 (2005) 702–711.
- [21] Santi P. Topology Control in Wireless Ad Hoc and Sensor Networks (Wiley, 2005).
- [22] Sokal R. R. and Oden N. L. Spatial autocorrelation in biology 1. Methodology. Biological Journal of the Linnean Society 10 (2008) 199–228.
- [23] Song W.-Z., Wang Y., Li X.-Y. Localized algorithms for energy efficient topology in wireless ad hoc networks. In: Proc. MobiHoc 2004 (May 24-26, 2004, Roppongi, Japan).
- [24] Sridharan M. and Ramasamy A. M. S. Gabriel graph of geomagnetic Sq variations. Acta Geophysica (2010) 10.2478/s11600-010-0004-y
- [25] Toroczkai Z. and Guclu H. Proximity networks and epidemics. Physica A 378 (2007) 68. arXiv:physics/0701255v1
- [26] Wan P.-J., Yi C.-W. On the longest edge of Gabriel Graphs in wireless ad hoc networks. IEEE Trans. on Parallel and Distributed Systems 18 (2007) 111–125.
- [27] Watanabe D. A study on analyzing the road network pattern using proximity graphs. J of the City Planning Institute of Japan 40 (2005) 133–138.
- [28] Watanabe D. Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks. Forma 23 (2008) 81-87.