Abstract

The technique of optical symbolic substitution is applied to development of a new filling algorithm that reconstructs an image from its boundary in constant time, whereas known filling algorithms have at least O(n log N) time complexity, where n is the number of boundary pixels of a polygon and N is the diameter of the image expressed in terms of pixels.

Full Text
Paper version not known

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 call

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.