System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours. For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
A new very efficient linear algorithm for the segmentation of 8-connected digital curves is given. The simplicity comes from a definition of digital lines using a linear double diophantine inequality. A complete Pascal source code is given.
An analog of extended real line, n-sphere and n-disc in the setting of digital topology has been provided and the fundamental group of the digital circle has been computed which comes out to be the additive group Z of integers.
A new very efficient linear algorithm for the segmentation of 8-connected digital curves is given. The simplicity comes from a definition of digital lines using a linear double diophantine inequality. A complete Pascal source code is given.