Minimal Horizontal Triods: Analysis and Computation

In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we investigate their characterization. We then formulate a horizontal curve shortening flow that deforms any given suitable initial triod into a critical point for the length functional. Numerical experiments based on a stable fully discrete finite element scheme provide useful insights into the rich landscape of this sub-Riemannian geometry