Abstract
Based on previous results in digital topology, this paper focuses on algorithms related to topological invariants of objects in 2D and 3D Digital Spaces. Specifically, we are interested in hole counting objects in 2D and closed surface genus calculation in 3D. We also present a proof of the hole counting formula in 2D. This paper includes fast algorithms and implementations for topological invariants such as connected components, hole counting in 2D, and boundary surface genus for 3D. For 2D images, we designed a linear time algorithm to solve the hole counting problem. In 3D, we also designed a O(n) time algorithm to obtain the genus of a closed surface. These two algorithms are both in \(O(\log n)\) space complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brimkov, V.E., Klette, R.: Border and surface tracing. IEEE Trans. Pattern Anal. Mach. Intell. 30(4), 577–590 (2008)
Chen, L.: Discrete Surfaces and Manifolds. SP Computing, Rockville (2004)
Chen, L.: Genus computing for 3D digital objects: algorithm and implementations. In: Proceedings of the Workshop on Computational Topology in Image Context 2009, Austria, pp. 29–40 (2009)
Chen, L.: Determining the number of holes of a 2D digital component is easy, November 2012. http://arxiv.org/abs/1211.3812
Chen, L.: Digital Functions and Data Reconstruction. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-5638-4
Chen, L.: Digital and Discrete Geometry. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-319-12099-7
Chen, L., Rong, Y.: Linear time recognition algorithms for topological invariants in 3D. In: Proceedings of International Conference on Pattern Recognition (ICPR08) (2008)
Chen, L., Biswas, S.: Digital curvatures applied to 3D object analysis and recognition: a case study. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 45–58. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34732-0_4
Dey, T.K., Guha, S.: Computing homology groups of simplicial complexes in \(R^3\). J. ACM 45, 266–287 (1998)
Gholizadeh, S.: Topological data analysis in text processing. Doctoral Dissertation, The University of North Carolina at Charlotte (2020)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
Lin, X., Yang, J., Summers, W.: Hold holes countable in binary images. Technicial report, School of Computer Science, Colubus State University (2010). http://cs.columbusstate.edu/about_us/HolesCounting-Technical-Report.pdf
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Image Analysis. Morgan Kaufmann, Burlington (2004)
Kong, T.Y., Rosenfeld, A. (eds.): Topological Algorithms for Digital Image Processing. Elsevier, Amsterdam (2006)
Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21(4), 163–169 (1987)
Pavlidis, T.: Theodosios Algorithms for Graphics and Image Processing. Computer Science Press (1982)
Qian, K., Bhattacharya, P.: Determining holes and connectivity in binary images. Comput. Graph. 16(3), 283–288 (1992)
Siqueira, M., Latecki, L.J., Tustison, N., Gallier, J., Gee, J.: Topological repairing of 3D digital images. J. Math. Imaging Vis. 30(3), 249–274 (2008)
Snášel, V., Nowaková, J., Xhafa, F., Barolli, L.: Geometrical and topological approaches to big data. Future Gener. Comput. Syst. 67, 286–296 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Chen, L. (2021). Algorithms for Computing Topological Invariants in Digital Spaces. In: Nguyen, M., Yan, W.Q., Ho, H. (eds) Geometry and Vision. ISGV 2021. Communications in Computer and Information Science, vol 1386. Springer, Cham. https://doi.org/10.1007/978-3-030-72073-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-72073-5_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72072-8
Online ISBN: 978-3-030-72073-5
eBook Packages: Computer ScienceComputer Science (R0)