Abstract
This paper addresses a generalization of polyominoes called (a, b)-connected discrete figures, where a and b represent the connectivity of the foreground (i.e. black pixels) and background (i.e. white pixels), respectively. Formally, a finite set of pixels P is (a, b)-connected if P is a-connected and P is b-connected. By adapting a combinatorial structure enumeration algorithm by J. L. Martin and employing breadth-first search ordering on the pixels of the figures, we sequentially generate all (a, b)-connected discrete figures up to size n = 18, utilizing minimal storage space. This paper presents an extended version of the research presented at the 2022 GASCom conference.
Published Version
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 callDisclaimer: 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.
