This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. L. Rvachev and Yu. G. Stoyan, “The problem of optimal cut-outs,” in: Problems of Theoretical Cybernetics [in Russian], Naukova Dumka, Kiev (1965).
L. A. Lyusternik, Convex Figures and Polygons [in Russian], Gostekhizdat, Moscow (1956).
L. Fejes Tóth, Arrangement of Figures in the Plane, on the Sphere, and in Space [Russian translation], Fizmatgiz, Moscow (1958).
Yu. G. Stoyan, The Optimum Placement of Geometric Objects [in Russian], Author's Abstract of Doctoral Dissertation, Moscow (1959).
A. G. Glushko, V. L. Rvachev, and Yu. G. Stoyan, “The densest coverage of a strip by figures of complex geometric shape,” Kibernetika, No. 4 (1968); No. 3 (1969).
V. L. Rvachev, Geometric Applications of the Algebra of Logic [in Russian], Tekhnika, Kiev (1967).
V. I. Bokii, L. A. Guzhva, and Yu. G. Stoyan, “An algorithm for the best lattice-type filling of a plane and a rectangular region with congruent figures,” in: Vychislitel'naya Tekhnika v Mashinostroenii [in Russian], No. 15, Izd. Akad. Nauk BSSR, Minsk (1970).
D. J. Wilde, Optimum-Seeking Methods, Prentice-Hall (1964).
Additional information
Translated from Kibernetika, No. 1, pp. 130–138, January–February, 1973.
Rights and permissions
About this article
Cite this article
Guzhva, L.A., Stoyan, Y.G. A method for filling a plane or a rectangular region with congruent figures arranged in a lattice. Cybern Syst Anal 9, 156–167 (1973). https://doi.org/10.1007/BF01068679
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068679