๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Connectivity and consecutivity in digital pictures

โœ Scribed by Jean-Marc Chassery

Publisher
Elsevier Science
Year
1979
Weight
292 KB
Volume
9
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Dynamic connectivity in digital images
Dynamic connectivity in digital images
โœ David Eppstein ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 589 KB

We show that any algorithm that maintains the connected components of a digital image must take R (log n/ log log n) time per change to the image. The problem can be solved in O(logn) time per change using dynamic planar graph techniques. We discuss applications to computer Go and other games. @

Topological changes in grey-tone digital
Topological changes in grey-tone digital pictures
โœ Carlo Arcelli ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

The pictorial contents of a grey-tone picture can be simpli"ed by diminishing the number of regions present in it as well as by reducing the size of some of them. Lowering operations which do not cause topological changes in the picture can conveniently be used to this purpose. More e$ciency can be