Reproduce “The Containment Polytope of a Triangle and a Convex Polygon” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yoonsung Choi, Sunghee Choi
The authors construct a compact representation of the largest similar triangle placements inside a convex polygon across all orientations. The silhouette is decomposed into O(n) convex chains and steps, built in O(n log n) time under general-position assumptions. This supports O(log n) queries for a specified orientation and computation of actual silhouette complexity in O(n log n) time, without bounding its worst-case complexity linearly.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.