Algorithmic study of wireless networks with angular constraints has led to the definition of a new geometric structure, the bounded-angle (minimum) spanning tree. In this talk, I will introduce this structure and discuss several problems concerning its existence and construction.