Abstract
A procedure is given for translating a rectangular grid in such a way that a finite set of points in ℝN is approximated as good as possible by points of the translated grid.
Zusammenfassung
Es wird ein Verfahren zur Bestimmung einer Translation eines rechtwinkeligen Gitters mit der Eigenschaft, daß eine endliche Punktmenge des ℝN möglichst gut durch Gitterpunkte approximiert wird, angegeben.
This is a preview of subscription content, log in via an institution to check access.
References
Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley 1974.
Burkard, R. E.: Optimal schedules for periodically recurring events. Discrete Applied Mathematics15, 167–180 (1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brucker, P., Meyer, W. Approximation of a set of points by points of a grid. Computing 38, 341–345 (1987). https://doi.org/10.1007/BF02278711
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02278711