Let $S$ be a set of $n$ points in the plane in general position (no 3 on a line), $n$ even.
A halving line is a line through $2$ points of $S$ that partitions $S$ into 2 equal parts ($(n-2)/2$ points on each side).
A halving edge is the restriction of a halving line to the segment between the two points it connects.
A half-set of $S$ is a subset of the form $T=S∩H$ for some halfspace $H,$ such that $|T|=n/2.$ See this image.
Halving edges are more convenient to work with than halving lines, as we can see in figure.
Let $e=pq$ be a halving edge, with $p$ left of $q.$
Define next(e) as follows: Let $ℓ$ be a line through $e.$ Rotate $ℓ$ CW around $q$ until we hit the next halving edge of $q$. If $ℓ$ becomes vertical before we hit any halving edge, next(e) is undefined. We see the interpretation where next(e'′) is undefined.
Defining prev(e): Rotate $ℓ$ CCW around $p$. See also this.
Given a halving edge $e$, the convex chain of $e$ is obtained by repeatedly applying next() and prev() as much as possible. For visualization see here.
My question is how to Prove that every point in the left half starts exactly one convex chain, and every point in the right half ends exactly one convex chain? And is it possible to conclude that the halving edges are partitioned into exactly $n/2$ convex chains?