A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry
From MaRDI portal
Publication:322024
DOI10.1016/j.akcej.2015.11.020zbMath1346.05010MaRDI QIDQ322024
Hugues Talbot, Daniel Khoshnoudirad
Publication date: 14 October 2016
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.020
68R01: General topics of discrete mathematics in relation to computer science
05A15: Exact enumeration problems, generating functions
68U10: Computing methodologies for image processing
05A19: Combinatorial identities, bijective combinatorics
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
05C30: Enumeration in graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- On digital plane preimage structure
- Patterns in Discretized Parabolas and Length Estimation
- On the number of digital straight line segments
- Farey lines defining Farey diagrams and application to some discrete structures
