Dynamic Connectivity in Digital Images (1996) [5 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {David Eppstein},
title = {Dynamic Connectivity in Digital Images},
year = {1996}
}
Bookmarks
OpenURL
Abstract:
We show that any algorithm that maintains the connected components of a digital image must take #(log n/ log log n) time per change to the image. The problem can be solved in O(log n) time per change using dynamic planar graph techniques. We discuss applications to computer Go and other games. Keywords: dynamic planar connectivity, percolation, lower bounds, image processing, go, lines of action. # Work supported in part by NSF grant CCR-9258355 and by matching funds from Xerox Corp. 1 1 Introduction A basic problem in image processing consists of finding the connected components of a bitmap image (where each component consists of pixels of a common color adjacent vertically, horizontally, or sometimes diagonally; the same problem applies also to finding regions of an image separated from each other by an edge detection operator). This is a special case of graph connectivity, and can easily be solved in linear time by depth-first search, but there has been some research on fas...
