By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth nearest neighbors for the square lattice and the ninth nearest neighbors for the simple cubic lattice. We find precise thresholds for 23 systems using a single-cluster growth algorithm. Site percolation on lattices with compact neighborhoods can be mapped to problems of lattice percolation of extended shapes, such as disks and spheres, and the thresholds can be related to the continuum thresholds ηc for objects of those shapes. This mapping implies zpc ∼ 4ηc = 4.51235 in 2D and zpc ∼ 8ηc = 2.73512 in 3D for large z for circular and spherical neighborhoods respectively, where z is the coordination number. Fitting our data to the form pc = c/(z + b) we find good agreement with c = 2 d ηc, where the constant b represents a finite-z correction term. We also study power-law fits of the thresholds.