Approximating a real number by a rational number with a limited denominator: a geometric approach
From MaRDI portal
Publication:967407
DOI10.1016/j.dam.2009.03.005zbMath1186.68493OpenAlexW1966244777MaRDI QIDQ967407
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.005
bezout identitycontinued fraction decompositioninteger convex hullsKlein sailslogarithmic time complexity
Related Items
Birkhoff averages and rotational invariant circles for area-preserving maps ⋮ A fast computation of the best \(k\)-digit rational approximation to a real number ⋮ On the Farey sequence and its augmentation for applications to image analysis ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Unnamed Item
Uses Software
Cites Work
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Computing Two-Dimensional Integer Hulls
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximating a real number by a rational number with a limited denominator: a geometric approach