Principal vertex of a dual cube complex (source code)

= Principal vertex of a dual cube complex

A point $x\in S$ determines a principal vertex by choosing, for every wall, the halfspace containing $x$. The combinatorial distance between the principal vertices of $x$ and $y$ is $d_{\mathcal W}(x,y)$.