Abstract
In this paper, we address the following problem: a direction in R d is given by a vector with large integral coordinates and we have to find a vector with bounded integral coordinates which realizes a good approximation of this direction. We present a short algorithm that efficiently computes an optimal approximation with respect to the distance to the direction. We then compare experimental results with those of a straightforward rounding algorithm with respect to the distance to the direction and to the angle with it.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Berstel and A. De Luca, Sturmian words, Lyndon words and trees, Theoretical Computer Science 178 (1997) 171–203.
M. Duque-Antón, D. Kunz and B. Ruber, Channel assignment for cellular radio using simulated annealing, IEEE Transactions on Vehicular Techology 42(1) (1993) 14–21.
W.K. Hale, Frequency assignment: Theory and applications, Proceedings of IEEE 68 (1980) 1497–1514.
X. Lagrange, P. Godlewski and S. Tabbane, Réseaux GSM-DCS (Hermès, 1995).
V.H. MacDonald, Advanced mobile phone service: The cellular concept, Technical Journal 58 (1979) 15–41.
M. Mouly and M.-B. Pautet, The GSM System for Mobile Communication (1993).
W.F. Rogers, Procedural Elements for Computer Graphics (McGraw-Hill, New York, 1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Novelli, JC., Schaeffer, G. & Hivert, F. Approximation of a Direction of Nd in Bounded Coordinates. Mobile Networks and Applications 6, 547–550 (2001). https://doi.org/10.1023/A:1011818306681
Issue Date:
DOI: https://doi.org/10.1023/A:1011818306681