Abstract
Apart from the widely used square grid, other regular grids (hexagonal and triangular) are gaining prominence in topological data analysis and image analysis/processing communities. One basic but important integer-valued topological descriptor of binary images in these grids is the Euler characteristic.
We extend two algorithms for the computation of the Euler characteristic from the square to the triangular grid, taking into account specific properties of the triangular grid. The first algorithm is based on simple cell counting, and the second is based on critical point approach. Both algorithms iterate over the grid vertices. We extend also their improvement based on reusing information common to the previous and the next vertex in the scan order. Our experiments show that the critical point based algorithms outperform the naive cell-counting ones, with the improved versions reducing the average runtime further.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borgefors, G., Sanniti di Baja, G.: Skeletonizing the distance transform on the hexagonal grid. In: 9th International Conference on Pattern Recognition, ICPR, pp. 504–507 (1988)
Čomić, L.: Gaps and well-composed objects in the triangular grid. In: Marfil, R., Calderón, M., Díaz del Río, F., Real, P., Bandera, A. (eds.) CTIC 2019. LNCS, vol. 11382, pp. 54–67. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-10828-1_5
Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal, and triangular arrays. Commun. ACM 15(9), 827–837 (1972)
Dutt, M., Andres, E., Largeteau-Skapin, G.: Characterization and generation of straight line segments on triangular cell grid. Pattern Recogn. Lett. 103, 68–74 (2018)
Freeman, H.: Algorithm for generating a digital straight line on a triangular grid. IEEE Trans. Comput. 28(2), 150–152 (1979)
Golay, M.J.E.: Hexagonal parallel pattern transformations. IEEE Trans. Comput. 18(8), 733–740 (1969)
Gray, S.: Local properties of binary images in two dimensions. IEEE Trans. Comput. 20, 551–561 (1971)
Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Process. 4(9), 1213–1222 (1995)
Kardos, P., Palágyi, K.: Topology preservation on the triangular grid. Ann. Math. Artif. Intell. 75(1–2), 53–68 (2015)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann Publishers, San Francisco (2004)
Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48(3), 357–393 (1989)
Kovalevsky, V.A.: Geometry of Locally Finite Spaces (Computer Agreeable Topology and Algorithms for Computer Imagery). Editing House Dr. Bärbel Kovalevski, Berlin (2008)
Morgenthaler, D.: Three-dimensional digital topology: the genus. Technical report TR-980, University of Maryland, College Park, MD 20742 (1980)
Nagy, B.: Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. Ann. Math. Artif. Intell. 75(1–2), 117–134 (2015)
Nagy, B., Lukić, T.: Dense projection tomography on the triangular tiling. Fundam. Inform. 145(2), 125–141 (2016)
Sarkar, A., Biswas, A., Dutt, M., Bhowmick, P., Bhattacharya, B.B.: A linear-time algorithm to compute the triangular hull of a digital object. Discrete Appl. Math. 216, 408–423 (2017)
Sarkar, A., Biswas, A., Dutt, M., Mondal, S.: Finding shortest triangular path and its family inside a digital object. Fundam. Inform. 159(3), 297–325 (2018)
Wiederhold, P., Morales, S.: Thinning on quadratic, triangular, and hexagonal cell complexes. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 13–25. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78275-9_2
Yao, B., et al.: An efficient strategy for bit-quad-based Euler number computing algorithm. IEICE Trans. Inf. Syst. E97.D(5), 1374–1378 (2014)
Acknowledgement
This work has been partially supported by the Ministry of Education and Science of the Republic of Serbia within the Project No. 34014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Čomić, L., Blesić, A. (2019). On the Computation of the Euler Characteristic of Binary Images in the Triangular Grid. In: Vento, M., Percannella, G. (eds) Computer Analysis of Images and Patterns. CAIP 2019. Lecture Notes in Computer Science(), vol 11679. Springer, Cham. https://doi.org/10.1007/978-3-030-29891-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-030-29891-3_49
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29890-6
Online ISBN: 978-3-030-29891-3
eBook Packages: Computer ScienceComputer Science (R0)