scientific article; zbMATH DE number 7124284
zbMATH Open1425.05010MaRDI QIDQ5241118FDOQ5241118
Publication date: 30 October 2019
Title of this publication is not available (Why is that?)
discrete geometrycombinatorial geometryDiophantine equationsdiscrete planesarithmetical geometrycombinatorial number theoryFarey diagramsgraph theory in computer sciencestheoretical computer sciences
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) General topics of discrete mathematics in relation to computer science (68R01) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On digital plane preimage structure
- Digital Planar Surface Segmentation Using Local Geometric Patterns
- 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
- A Note on Boolean Lattices and Farey Sequences II
- Farey lines defining Farey diagrams and application to some discrete structures
- Duality and Geometry Straightness, Characterization and Envelope
- Combinatorial Image Analysis
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- On the number of digital straight line segments
- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241118)
