This monography presents results related to the convex geometry of a family of simplicial complexes called ``subword complexes''. These simplicial complexes are defined using the Bruhat order of Coxeter groups. Despite a simple combinatorial definition much of their combinatorial properties are still not understood. In contrast, many of their known connections make use of specific geometric realizations of these simplicial complexes. When such realizations are missing, many connections can only be conjectured to exist. This monography lays down a framework using an alliance of algebraic combinatorics and discrete geometry to study further subword complexes. It provides an abstract, though transparent, perspective on subword complexe...