A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry

zbMath1344.05015MaRDI QIDQ307928

Daniel Khoshnoudirad

Publication date: 5 September 2016

Published in: Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial geometrydiscrete geometryDiophantine equationsdiscrete planesarithmetical geometrycombinatorial number theoryFarey diagramsgraph theory in computer sciencestheoretical computer sciences

Mathematics Subject Classification ID

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)

Related Items (1)

A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry

Cites Work

• 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
• 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
• Digital Planar Surface Segmentation Using Local Geometric Patterns
• Combinatorial Image Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry