A lattice point \(\left( {x,y} \right) \in Z^{2}\) said to be visible from the origin if the line segment joining (0, 0) and \(\left( {x, y} \right)\) contains no other lattice point, which is equivalent to the condition \(\gcd \left( {x,y} \right) = 1\) . We introduce the concepts of Fibonacci and Lucas lattice point visibility by mapping each point in the Cartesian plane to an ordered pair derived from its corresponding integer sequence. In this paper, we explore a new connection between the visibility of lattice points in the Fibonacci and Lucas sequences. We define the Fibonacci lattice point as \(P_{n}^{\left( F \right)} = \left( {F_{n} ,F_{n + k} } \right):n, k \ge 1, \) and the Lucas lattice point as \(P_{n}^{\left( L \right)} = \left( {L_{n} , L_{n + k} } \right):n, k \ge 0\) . This representation enables a systematic analysis of visibility properties, including both the mutual visibility among lattice points and visibility from the origin within structures governed by these classical integer sequences.
