Please login to be able to save your searches and receive alerts for new content matching your search criteria.
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 ℤ 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.