Scholarlink

<p>We introduce ConDT algorithm, a proximity-based reconstruction method relying on Delaunay triangulation. The underlying proximity graph is referred to as the ConDT graph. In addition to being simple, the algorithm could successfully handle various challenging cases where classical reconstruction algorithms often struggle. Outlier removal is done in the post-processing phase using interquartile range (IQR) criteria, computed for the specific instance of the proximity graph. Relying on the recent benchmark on 2D reconstruction, we show that our method works better or is on par with the state-of-the-art methods.</p>

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

ConDT: A 2D curve reconstruction algorithm based on a constrained neighbor proximity graph

  • 期刊论文

  • 发表日期：

    2025年5月25日

查看全文
  • J. Antony,
  • M. Reghunath,
  • S. B. Thayyil,
  • R. Muthuganapathy

摘要

We introduce ConDT algorithm, a proximity-based reconstruction method relying on Delaunay triangulation. The underlying proximity graph is referred to as the ConDT graph. In addition to being simple, the algorithm could successfully handle various challenging cases where classical reconstruction algorithms often struggle. Outlier removal is done in the post-processing phase using interquartile range (IQR) criteria, computed for the specific instance of the proximity graph. Relying on the recent benchmark on 2D reconstruction, we show that our method works better or is on par with the state-of-the-art methods.