The present paper deals with discrete lines in the $3$-dimensional space. In particular, we focus on the minimal $0$-connected set of closest integer points to a Euclidean line. We propose a definition which leads to geometric, arithmetic and algorithmic characterizations of naive discrete lines in the $3$-dimensional space.