1
Lenstra H W. Integer programming with a fixed number of variables[J]. Mathematics of Operations Research, 1983, 8(4): 538-548.
2
Edelsbrunner H. Algorithms in combinatorial geometry[J]. American Mathematical Monthly, 1987, 96(5).
3
Dacey M F. THE GEOMETRY OF CENTRAL PLACE THEORY[J]. Geografiska Annaler Series B-human Geography, 2016, 47(2).
4
Gabor Fejes Toth · Wlodzimierz Kuperberg. Packing and Covering with Convex Sets. 1993.
5
Toth G F. New Results in the Theory of Packing and Covering[C]., 1983: 318-359.
6
Norman Oler. An inequality in the geometry of numbers. 1961.
7
Kuperberg G, Kuperberg W. Double-lattice packings of convex bodies in the plane[J]. Discrete and Computational Geometry, 1990, 5(4): 389-397.
8
N P Willis · Yoram Bresler. Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I. 1997.
9
Mount D M, Silverman R. Packing and covering the plane with translates of a convex polygon[J]. Journal of Algorithms, 1990, 11(4): 564-580.
10
Gritzmann P, Wills J M. Finite Packing and Covering[C]., 1993: 861-897.