Dynamic connectivity in digital images

DOI10.1016/S0020-0190(97)00056-2MaRDI QIDQ290227zbMATH OpenFDO

Authors David Eppstein

Publication date 1 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitylower boundsimage processingpercolationcomputer Godynamic planar connectivitylines of action

Mathematics Subject Classification ID

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)

Recommendations

• Faster worst case deterministic dynamic connectivity
• Maintaining bridge-connected and biconnected components on-line
• scientific article; zbMATH DE number 176746
• A topological approach to dynamic graph connectivity
• Dynamic Connectivity for Axis-Parallel Rectangles

Cites work

• scientific article; zbMATH DE number 193098 (Why is no real title available?)
• scientific article; zbMATH DE number 871905 (Why is no real title available?)
• A general approach to connected-component labeling for arbitrary image representations
• Improved data structures for fully dynamic biconnectivity
• Lower bounds for fully dynamic connectivity problems in graphs
• Maintenance of a minimum spanning forest in a dynamic plane graph
• Separator based sparsification for dynamic planar graph algorithms

Cited in

(4)

• A study of connectivity on dynamic graphs: computing persistent connected components
• scientific article; zbMATH DE number 2045904 (Why is no real title available?)
• scientific article; zbMATH DE number 5692253 (Why is no real title available?)
• A convenient graph connectedness for digital imagery

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)