We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| belalugax/rigid-origami | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| auto_transform_mesh | Ran | belalugax/rigid-origami/gym-rori/rewarders.py pointer only (licence: NOASSERTION) · get_code("a166f20f2e030fae") |
| bucket_rewarder | Ran | belalugax/rigid-origami/gym-rori/rewarders.py pointer only (licence: NOASSERTION) · get_code("ac4b2b507f7d8631") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Rigid origami has shown potential in large diversity of practical applications. However, current rigid origami crease pattern design mostly relies on known tessellations. This strongly limits the diversity and novelty of patterns that can be created. In this work, we build upon the recently developed principle of three units method to formulate rigid origami design as a discrete optimization problem, the rigid origami game. Our implementation allows for a simple definition of diverse objectives and thereby expands the potential of rigid origami further to optimized, application-specific crease patterns. We showcase the flexibility of our formulation through use of a diverse set of search methods in several illustrative case studies. We are not only able to construct various patterns that approximate given target shapes, but to also specify abstract, function-based rewards which result in novel, foldable and functional designs for everyday objects.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2211.13219")
get_code_for_paper("2211.13219")
have("2211.13219")
Connect an agent — have() is free.