arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

从部分信息重建凸多边形

On Reconstructing a Convex Polygon from Partial Information

Alexander Baumann, Therese Biedl, Mahmoud Elashmawi, Simon D. Fink, Maria Saumell, André Schulz

arXiv 2607.01423首次发表:更新:

AI 中文总结

研究在给定一组或多组特征(如边长或角度)时重建凸多边形的问题,系统探索了各种场景,包括已知算法、新测试算法及困难性结果。

AI 中文摘要

重建问题要求构造一个(凸)多边形,该多边形具有指定的特征集,例如有序的边长集或有序的多边形角度集。在本文中,我们系统探索了在指定一组或两组特征的所有场景下的重建问题。其中一些场景已被充分研究,对于其他场景,我们开发了测试算法和/或困难性结果,并且许多场景为未来的研究提出了有趣的开问题。

英文摘要

The reconstruction problem asks to construct a (convex) polygon that has a specified set of features, such as an ordered set of edge-lengths or an ordered set of polygon-angles. In this paper, we do a systematic exploration of the reconstruction problem in all scenarios where one or two sets of features have been specified. Some of these scenarios were well-studied already, for some we develop testing-algorithms and/or hardness results, and many give rise to interesting open problems for future study.

CommentsTo appear at CCCG 2026

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑