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

Dynamic connectivity in digital images

โœ Scribed by David Eppstein

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
589 KB
Volume
62
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

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. @

๐Ÿ“œ SIMILAR VOLUMES

Problems in the determination of pore co
Problems in the determination of pore connectivity by digital image processing
โœ R. Scharfenberg; K. Meyerhoff; D. Hesse ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

In the practical use of porous materials, pore blocking processes can occur leading to a decrease of the accessibility of the pore space. This percolation-type behavior is mainly influenced by the connectivity of the pore network. In order to characterize this property of porous media, the usefulnes