This paper explores the reconstruction of convex polygons from one or two specified feature sets like edge lengths and angles, developing algorithms and hardness results for some cases while identifying open problems.
Open problems from CCCG 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Reconstructing a Convex Polygon from Partial Information
This paper explores the reconstruction of convex polygons from one or two specified feature sets like edge lengths and angles, developing algorithms and hardness results for some cases while identifying open problems.