We have finsihed a research on the approximation of point sets in arbitrary dimension by regular grids using the LLL (Lenstra-Lenstra-Lovász) algorithm. Our new approach helps to characterize the regularity of spatial structures, like networks, textures, etc. For more information, see: A. Hajdu, L. Hajdu, R. Tijdeman: Finding well approximating lattices for a finite set of points.
