Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Minimal Horizontal Triods: Analysis and Computation

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年2月25日

查看全文
  • Robert Nürnberg,
  • Paola Pozzi

摘要

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.