← Moser's Worm Problem / Rounds / Round 1
Implements the curve-to-convex-container containment problem as two linear programs: fixed rotation solving for the minimal container scale, and fixed scale solving for the minimal positive skew. Tests 35 candidate curves using 192 support directions and 60–120 initial rotation phases, completing 5 generations of lightweight adversarial curve search.
Relationship to other packages, stated as far as possible in the document's own words, not my interpretation.
“At fixed phase, the translation term occupies only the Fourier expansion's first-order sine and cosine modes… what actually stresses the container is the higher-order peaks that persist after translation — corresponding to the corners and long edges of the curve's convex hull and its asymmetric structure, mismatches between the container's normal sectors and the curve's normal sectors, and jumps in the optimal contact set. This carries more research information than simply recording whether the curve ‘fits.’” — excerpted from Section 4, “Preliminary Structural Findings,” of this package's main document.
Loading…
Loading…
sha256 d7a832b43af9e2537335a1c9be767b39069f914e53e20b42edf5864997f736da