A new algorithmic framework for basic problems on binary images (Q528334): Difference between revisions

@@ Property / cites work @@
+In-place algorithm for erasing a connected component in a binary image
+Normal rank
@@ Property / cites work @@
+Finding Nearest Larger Neighbors
@@ Property / cites work: Finding Nearest Larger Neighbors / rank @@
+Normal rank
@@ Property / cites work @@
+AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
+Normal rank
@@ Property / cites work @@
+Connected component labeling on coarse grain parallel computers: An experimental study
+Normal rank
@@ Property / cites work @@
+A general approach to connected-component labeling for arbitrary image representations
+Normal rank
@@ Property / cites work @@
+Q3155868
@@ Property / cites work: Q3155868 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
+Normal rank
@@ Property / cites work @@
+Implicit data structures for fast search and update
+Normal rank
@@ Property / cites work @@
+Connectivity in Digital Pictures
@@ Property / cites work: Connectivity in Digital Pictures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679095
@@ Property / cites work: Q3679095 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential Operations in Digital Picture Processing
+Normal rank
@@ Property / cites work @@
+Connected Component Labeling Using Quadtrees
@@ Property / cites work: Connected Component Labeling Using Quadtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time connected-component labeling based on sequential local operations
+Normal rank