A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
zbMATH Open1344.05015MaRDI QIDQ307928FDOQ307928
Authors: Daniel Khoshnoudirad 
Publication date: 5 September 2016
Published in: Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)
Recommendations
- Farey lines defining Farey diagrams and application to some discrete structures
- Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry
- On the cardinal of some finite subsets of the unit square
- Ubiquity and the Farey graph
- scientific article; zbMATH DE number 1342260
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?)
- 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
- Title not available (Why is that?)
- A Note on Boolean Lattices and Farey Sequences II
- Title not available (Why is that?)
- Topology of numbers
- Farey lines defining Farey diagrams and application to some discrete structures
- An introduction to the theory of numbers. Transl. from the English by François Sauvageot, introduction by Catherine Goldstein
- Duality and Geometry Straightness, Characterization and Envelope
- Combinatorial Image Analysis
- Enumeration formula for \((2,n)\)-cubes in discrete planes
Cited In (3)
- Farey lines defining Farey diagrams and application to some discrete structures
- Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry
- A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry
This page was built for publication: A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307928)
