Dynamic connectivity in digital images
DOI10.1016/S0020-0190(97)00056-2zbMath1337.68282MaRDI QIDQ290227
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
computational complexityimage processingpercolationlower boundscomputer Godynamic planar connectivitylines of action
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) 2-person games (91A05) Graph theory (including graph drawing) in computer science (68R10) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Lower bounds for fully dynamic connectivity problems in graphs
- Improved data structures for fully dynamic biconnectivity
- Maintenance of a minimum spanning forest in a dynamic plane graph
- A general approach to connected-component labeling for arbitrary image representations
- Separator based sparsification for dynamic planar graph algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic connectivity in digital images
