TOPICS
Search

Visible Point


VisiblePoints

A visible point relative to a specified lattice point P is another lattice point Q!=P for which the open line segment from P to Q contains no lattice point. Thus distinct points (x,y) and (x^',y^') of the integer lattice Z^2 are mutually visible iff (x^'-x,y^'-y)=1, where (m,n) denotes the nonnegative greatest common divisor, with (m,0)=|m|. The plots above show the first few points visible from the origin.

In an orchard interpretation, trees are idealized as fixed lattice points, and intervening lattice points block visibility. The orchard-planting problem uses the same imagery for a different task, arranging a fixed number of trees to maximize the number of lines containing exactly a prescribed number of them.

VisiblePoints1
VisiblePoints1

Here the probability of visibility is a limiting proportion obtained by choosing a lattice point uniformly from {-N,...,N}^n and letting N->infty. In the integer lattice Z^n with n>=2, the limiting probability that the point is visible from the origin is 1/zeta(n), where zeta(n) is the Riemann zeta function (Baake et al. 1994, pp. 2669-2670). In two dimensions this is 6/pi^2, also the limiting probability that two independently and uniformly chosen integers from {1,...,N} are relatively prime. In one dimension, only -1 and 1 are visible from the origin, so the limiting probability is 0.

InvisibleSquares

An invisible figure is a polygon all of whose vertices are lattice points invisible from the origin. For the invisible squares below, every lattice point on the boundary is included as a polygon vertex, allowing consecutive vertices on the same straight edge. Every finite set of lattice points can be translated so that all its points are invisible from the origin, by the Chinese remainder theorem. The lower left-hand corner of the invisible squares on a square grid with 0<y<x having smallest x-coordinate and side lengths 1 and 2 are (20, 14) and (54, 20), respectively. The first 3×3 invisible square has lower left-hand corner at (42273, 35397) (E. Weisstein, Mar. 1, 2009).

InvisibleSquarePositions

The first few 1×1 invisible squares occur at (20,14), (35,14), (35,20), (54,44), (65,39), ... (OEIS A157426 and A157427). The first few 2×2 invisible squares occur at (54,20), (174,98), (550,114), (574,368), (588,494), ... (OEIS A157428 and A157429). Both of these sets are plotted above for the first 1000 such squares.

InvisibleBox

The filled square with lower left-hand corner at (1308, 1274) is the first 2×2 square with 0<y<x for which all nine of its lattice points, including the point in its interior, are invisible from the origin.


See also

Euclid's Orchard, Jarník Polygon, Lattice Point, Orchard-Planting Problem, Orchard Visibility Problem, Relatively Prime, Riemann Zeta Function

Explore with Wolfram|Alpha

References

Apostol, T. §3.8 in Introduction to Analytic Number Theory. New York: Springer-Verlag, 1976.Asano, T.; Ghosh, S. K.; and Shermer, T. C. "Visibility in the Plane." Ch. 19 in Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia). Amsterdam, Netherlands: North-Holland, pp. 829-876, 2000.Baake, M.; Grimm, U.; and Warrington, D. H. "Some Remarks on the Visible Points of a Lattice." J. Phys. A: Math. Gen. 27, 2669-2674, 1994. https://doi.org/10.1088/0305-4470/27/8/006.Baake, M.; Moody, R. V.; and Pleasants, P. A. B. "Diffraction from Visible Lattice Points and kth Power Free Integers." 19 Jun 1999. https://arxiv.org/abs/math/9906132.Gardner, M. The Sixth Book of Mathematical Games from Scientific American. Chicago, IL: University of Chicago Press, pp. 208-210, 1984.Gosper, R. W. and Schroeppel, R. Item 48 in Beeler, M.; Gosper, R. W.; and Schroeppel, R. HAKMEM. Cambridge, MA: MIT Artificial Intelligence Laboratory, Memo AIM-239, p. 17, Feb. 1972. https://www.inwap.com/pdp10/hbaker/hakmem/number.html#item48.Herzog, F. and Stewart, B. M. "Patterns of Visible and Nonvisible Lattice Points." Amer. Math. Monthly 78, 487-496, 1971. https://doi.org/10.1080/00029890.1971.11992790.Mosseri, R. "Visible Points in a Lattice." J. Phys. A: Math. Gen. 25, L25-L29, 1992.Numberphile. "Tree Gaps and Orchard Problems." Jan. 26, 2018. https://www.youtube.com/watch?v=p-xa-3V5KO8.Schroeder, M. R. "A Simple Function and Its Fourier Transform." Math. Intell. 4, 158-161, 1982.Schroeder, M. R. Number Theory in Science and Communication, 2nd ed. New York: Springer-Verlag, 1990.Sloane, N. J. A. Sequences A157426, A157427, A157428, and A157429 in "The On-Line Encyclopedia of Integer Sequences."Steinhaus, H. Mathematical Snapshots, 3rd ed. New York: Dover, pp. 100-101, 1999.

Referenced on Wolfram|Alpha

Visible Point

Cite this as:

Weisstein, Eric W. "Visible Point." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/VisiblePoint.html

Subject classifications