This sequence of slides provides a great motivation for the half-edge structure. We want:
The half-edge data structure achieves these goals. However, it relies on the manifold nature of the surface to achieve the low-memory-footprint goal while also maintaining the ability to provide adjacency efficiently. So in exchange for achieving these goals, the half-edge data structure sacrifices some generality (as compared to a basic polygon soup representation).