scientific article; zbMATH DE number 7124284
zbMath1425.05010MaRDI QIDQ5241118
Publication date: 30 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial geometrydiscrete geometryDiophantine equationsdiscrete planesarithmetical geometrycombinatorial number theoryFarey diagramsgraph theory in computer sciencestheoretical computer sciences
General topics of discrete mathematics in relation to computer science (68R01) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- Extremal problems in discrete geometry
- On the number of linear partitions of the \((m,n)\)-grid
- Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
- Variants for the Hough transform for line detection
- Relative blocking in posets
- On digital plane preimage structure
- A Note on Boolean Lattices and Farey Sequences II
- On the number of digital straight line segments
- Farey lines defining Farey diagrams and application to some discrete structures
- Duality and Geometry Straightness, Characterization and Envelope
- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
- Digital Planar Surface Segmentation Using Local Geometric Patterns
- Combinatorial Image Analysis
This page was built for publication:
