In-place algorithm for erasing a connected component in a binary image (Q692939): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-011-9335-6
@@ Property / DOI: 10.1007/s00224-011-9335-6 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-011-9335-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2028366103
@@ Property / OpenAlex ID: W2028366103 / rank @@
+Normal rank
@@ Property / cites work @@
+In-Place Algorithm for Image Rotation
@@ Property / cites work: In-Place Algorithm for Image Rotation / rank @@
+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 @@
+Towards in-place geometric algorithms and data structures
+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 @@
+Connectivity in Digital Pictures
@@ Property / cites work: Connectivity in Digital Pictures / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00224-011-9335-6
@@ Property / DOI: 10.1007/S00224-011-9335-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:692939