In-place algorithm for erasing a connected component in a binary image (Q692939): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: In-Place Algorithm for Image Rotation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Nearest Larger Neighbors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards in-place geometric algorithms and data structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3155868 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Digital Pictures / rank | |||
Normal rank |
Revision as of 22:50, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | In-place algorithm for erasing a connected component in a binary image |
scientific article |
Statements
In-place algorithm for erasing a connected component in a binary image (English)
0 references
6 December 2012
0 references
binary image
0 references
component
0 references
connectivity
0 references
constant work space
0 references
0 references