Distance Geometry consists in embedding a simple weighted undirected graph in a given space so that the distances between embedded vertices correspond to the edge weights. Weights can be either exact real values, or real-valued intervals. In this work, the focus is on problems where the embedding space is the Euclidean 1-dimensional space, and the general situation where distances can be represented by intervals is taken into consideration. A previously proposed branch-and-prune algorithm is adapted to the 1-dimensional case, and the proposed variant turns out to be deterministic even in presence of interval distances. Backtracking pruning is introduced in the algorithm for guaranteeing that all vertex positions in a given solution are actually feasible. The proposed algorithm is tested on a set of artificially generated instances in dimension 1.