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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6714925 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
binary image
Property / zbMATH Keywords: binary image / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
connected component
Property / zbMATH Keywords: connected component / rank
 
Normal rank
Property / zbMATH Keywords
 
connected components labeling
Property / zbMATH Keywords: connected components labeling / rank
 
Normal rank
Property / zbMATH Keywords
 
connectivity
Property / zbMATH Keywords: connectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
constant workspace algorithm
Property / zbMATH Keywords: constant workspace algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
grid graph
Property / zbMATH Keywords: grid graph / rank
 
Normal rank
Property / zbMATH Keywords
 
small workspace algorithm
Property / zbMATH Keywords: small workspace algorithm / rank
 
Normal rank

Revision as of 07:12, 1 July 2023

scientific article
Language Label Description Also known as
English
A new algorithmic framework for basic problems on binary images
scientific article

    Statements

    A new algorithmic framework for basic problems on binary images (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    algorithm
    0 references
    binary image
    0 references
    computational complexity
    0 references
    connected component
    0 references
    connected components labeling
    0 references
    connectivity
    0 references
    constant workspace algorithm
    0 references
    grid graph
    0 references
    small workspace algorithm
    0 references

    Identifiers