Papers › Constrained Form-Finding of Tension-Compression Structures using Automatic Differentiation

Constrained Form-Finding of Tension-Compression Structures using Automatic Differentiation

4 Nov 2021arXiv:2111.02607links table onlyarchive 2025-07-28

Rafael Pastrana, Patrick Ole Ohlbrock, Thomas Oberbichler, Pierluigi D'Acunto, Stefana Parascho

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This paper proposes a computational approach to form-find pin-jointed, bar structures subjected to combinations of tension and compression forces. The generated equilibrium states can meet force and geometric constraints via gradient-based optimization. We achieve this by extending the combinatorial equilibrium modeling (CEM) framework in three important ways. First, we introduce a new topological object, the auxiliary trail, to expand the range of structures that can be form-found with the framework. Then, we leverage automatic differentiation (AD) to obtain an exact value of the gradient of the sequential and iterative calculations of the CEM form-finding algorithm, instead of a numerical approximation. Finally, we encapsulate our research developments into an open-source design tool written in Python that is usable across different CAD platforms and operating systems. After studying four different structures -- a self-stressed planar tensegrity, a tree canopy, a curved bridge, and a spiral staircase -- we demonstrate that our approach enables the solution of constrained form-finding problems on a diverse range of structures more efficiently than in previous work.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2111.02607")

Code

Syntology Ran 0 of 5 code samples harvested from 1 repository linked to this paper; 5 have no recorded run.

By repository: community (archive-listed): 5 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

arpastrana/cem_ad_cad officialmentioned in papermentioned on GitHub report
arpastrana/compas_cem mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

5 samples harvested; 0 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5unverified

Licence: 0 of the 5 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from arpastrana/compas_cem. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

equilibrium_state_numpy arpastrana/compas_cem/src/compas_cem/equilibrium/force_numpy.py community (archive-listed) unverified MIT (permissive) · 7a04b59f3f7027e4 · report
grad_autograd arpastrana/compas_cem/src/compas_cem/optimization/grad.py community (archive-listed) unverified MIT (permissive) · ce495a799b4d9215 · report
grad_finite_differences arpastrana/compas_cem/src/compas_cem/optimization/grad.py community (archive-listed) unverified MIT (permissive) · eab9c3b4d4e038df · report
nlopt_status arpastrana/compas_cem/src/compas_cem/optimization/nlopt.py community (archive-listed) unverified MIT (permissive) · 5910d39f77e0887e · report
node_equilibrium arpastrana/compas_cem/src/compas_cem/equilibrium/force_numpy.py community (archive-listed) unverified MIT (permissive) · 19116d29f038b8b8 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections