1. Baldoni, V., Berline, N., Vergne, M.: Summing a polynomial function over integral points of a polygon. User’s guide (2009). arXiv:0905.1820 [cs.CG]
2. Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. In: 34th Annual Symposium of Foundations of Computer Science, pp. 566–572. IEEE, Piscataway (Nov 1993)
3. Cohen, H.: A Course in Computational Number Theory, Third, corrected printing. Springer, Berlin (1996)
4. Hajdu, A., Hajdu, L., Tijdeman, R.: Finding well approximating lattices for a finite set of points. Math. Comput. (Accepted)
5. Hajdu, A., Harangi, B., Besenczi, R., Lázár, I., Emri, G., Hajdu, L., Tijdeman, R.: Measuring regularity of network patterns by grid approximations using the LLL algorithm. In: 23rd International Conference on Pattern Recognition (ICPR 2016), Cancun, Mexico, pp. 1525–1530 (2016)