Dynamic connectivity in digital images
DOI10.1016/S0020-0190(97)00056-2zbMATH Open1337.68282MaRDI QIDQ290227FDOQ290227
Authors: David Eppstein
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
computational complexitylower boundsimage processingpercolationcomputer Godynamic planar connectivitylines of action
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) 2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
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
- Title not available (Why is that?)
- A general approach to connected-component labeling for arbitrary image representations
- Title not available (Why is that?)
- Separator based sparsification for dynamic planar graph algorithms
Cited In (4)
This page was built for publication: Dynamic connectivity in digital images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290227)