Abstract
Neighbourhood Sequences are deemed to be important in many practical applications within digital imaging through their application in measuring digital distance.
Aggregation of neighbourhood sequences based on classical digital distance functions was proposed as an alternative method for organising swarms or robots on the non-oriented grid environment in [1]. Wave phenomena generated nodal patterns in a discrete environment via the two neighbourhood sequences providing a distributed algorithm to find the centre of a digital disc. The geometric shapes that can be formed by such sequences in 2-D are quite limited and so constraints are relaxed to allow any two points at euclidean distance r (r-neighbours) such neighbourhoods represented by the digital disc of radius r.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Martin, R., Nickson, T., Potapov, I.: Geometric Computations by Broadcasting Automata on the Integer Grid. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 138–151. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nickson, T., Potapov, I. (2012). Discrete Discs and Broadcasting Sequences. In: Durand-Lose, J., Jonoska, N. (eds) Unconventional Computation and Natural Computation. UCNC 2012. Lecture Notes in Computer Science, vol 7445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-32894-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32893-0
Online ISBN: 978-3-642-32894-7
eBook Packages: Computer ScienceComputer Science (R0)