Abstract
In this research, we present an innovative approach to connecting components using a Dynamic Identification Tree. The algorithm is designed to efficiently label connected components of digital objects, providing an improvement over existing methods. The dynamic identification tree enables accurate and fast labeling, thus facilitating topology analysis of digital objects. This approach promises universal applicability and exceptional efficiency in various data processing contexts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Mathematical Techniques and Computational Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
