Summary: We introduce a family of directed geometric graphs, whose vertices are points in \({\mathbb{R}}^d\). The graphs \(G^\theta_\lambda\) in this family depend on two real parameters \(\lambda \) and \(\theta\). For \(\frac{1}{2} < \lambda < 1\) and \(\frac {\pi}{3} < \theta < \frac{\pi}{2}\), the graph \(G^\theta_\lambda\) is a strong \(t\)-spanner for \(t = \frac{1}{(1-\lambda)\cos\theta}\). That is, for any two vertices \(p\) and \(q\), \(G^\theta_\lambda\) contains a path from \(p\) to \(q\) of length at most \(t\) times the Euclidean distance \(|pq|\), and all edges on this path have length at most \(|pq|\). The out-degree of any node in the graph \(G^\theta_\lambda\) is \(O(1/\phi^{d-1})\), where \(\phi = \min(\theta,\arccos\frac{1}{2\lambda})\). We show that routing on \(G^\theta_\lambda\) can be achieved locally. Finally, we show that all strong \(t\)-spanners are also \(t\)-spanners of the unit-disk graph.