---
title: 'OpenTO: 2D Topology Optimization Dataset'
url: https://www.emergentmind.com/topics/opento
type: topic
---

# OpenTO: 2D Topology Optimization Dataset

OpenTO is a large, procedurally generated corpus of optimized 2D structural layouts introduced to address the generalizability limitations of prior deep-learning datasets for topology optimization. It was designed to support resolution- and shape-agnostic learning under arbitrary boundary conditions and forces, with broad variation in aspect ratio, discretization, volume fraction, fixtures, and loads, including interior point fixtures and interior forces [2510.23667]. Within the same work, OpenTO serves as the data foundation for OAT, a single model intended to generalize across unseen aspect ratios, resolutions, and boundary/load configurations in minimum-compliance topology optimization under linear elasticity [2510.23667].

## 1. Origin and problem setting

OpenTO was introduced to overcome what the source paper calls the “generalizability challenge” in deep-learning-based topology optimization [2510.23667]. Earlier datasets were typically small and narrow: they often used fixed square domains, commonly $64 \times 64$, a small number of hand-coded boundary-condition configurations, single loads, and loads or fixtures applied only on boundaries. The paper states that some prior settings used as few as 42 boundary-condition configurations, which made learned models resolution- and shape-dependent and caused failure on unseen boundary conditions [2510.23667].

The corpus was therefore designed to change the regime of supervision rather than merely increase sample count. Its defining design choices are mixed resolutions, arbitrary rectangular aspect ratios within a single dataset, randomized fixtures and loads, interior as well as boundary applications, many simultaneous loads per problem, and broad coverage of target volume fractions and discretizations [2510.23667]. This suggests that OpenTO is best understood not simply as a benchmark repository, but as infrastructure for training models whose latent representations and decoders are not tied to a single grid or to a small catalog of canonical mechanics problems.

The underlying optimization problem throughout the corpus is minimum-compliance topology optimization under linear elasticity with a volume constraint on total material. OpenTO’s layouts are therefore not arbitrary synthetic patterns; they are converged solutions generated by a standard SIMP-style iterative solver with finite-element analysis at each step and volume-constraint enforcement [2510.23667].

## 2. Scale, composition, and coverage

OpenTO contains 2.194 million samples of optimized topologies and approximately 2 million unique boundary-condition configurations obtained by fully random sampling of fixture locations and directions; interior fixtures are explicitly included [2510.23667]. The dataset also incorporates 194,000 samples from the prior NITO dataset, bringing legacy benchmarks into the same corpus [2510.23667].

A central distinction in the corpus is between labeled and unlabeled samples. The paper states that 894,000 samples include full problem specifications paired with optimized solutions, while the remaining samples provide topologies only [2510.23667]. The labeled subset is used for conditional generation, whereas the full corpus is used to pretrain a resolution-free autoencoder.

| Component | Quantity | Role |
|---|---:|---|
| Total samples | 2.194 million | Full OpenTO corpus |
| Unique BC configurations | approximately 2 million | Coverage of randomized fixtures and loads |
| Labeled samples | 894,000 | Conditional training with full specifications |
| Added NITO samples | 194,000 | Unified legacy benchmark integration |
| Held-out test problems | 5,000 | Fully randomized generalization benchmark |

The geometric and loading coverage is unusually broad for the literature described in the paper. Rectangular domains span narrow to square shapes, with aspect ratios up to $10\!:\!1$, and pixel or cell sizes range from $1/64$ to $1/1024$ [2510.23667]. Resolutions include canonical $64 \times 64$ and $256 \times 256$ cases, but also other rectangular grids. Each problem records a target volume fraction $\mathrm{VF}$, domain aspect ratio $a$, cell size $s$, and sets of forces and fixtures [2510.23667].

Force configurations are fully randomized in location, direction, and magnitude, and may include up to 4000 loads in a single problem, with distributed loads covered [2510.23667]. Fixture sets consist of point fixtures with binary features indicating fixed degrees of freedom, and both boundary and interior fixtures are possible [2510.23667]. The paper emphasizes that inputs are distributed broadly and randomly across the corpus to ensure coverage rather than concentration in a few easy regimes.

## 3. Physical formulation and generation pipeline

OpenTO’s ground-truth layouts are generated from the standard density-based formulation of topology optimization. The equilibrium equation is

$$
K(\rho)u = f,
$$

where $u$ is the displacement field, $f$ the global force vector, and $K(\rho)$ the stiffness matrix assembled from element moduli interpolated by $\rho$ [2510.23667]. Compliance is written as

$$
C = f^{\top}u,
$$

and the elementwise material interpolation follows the SIMP law

$$
E(\rho) = E_{\min} + \rho^{p}(E_0 - E_{\min}),
$$

with $\rho \in [0,1]$, base Young’s modulus $E_0$, a small positive void modulus $E_{\min}$, and penalization exponent $p$ [2510.23667]. The volume-fraction constraint is

$$
\frac{1}{N}\sum_{i=1}^{N}\rho_i \le v^*,
$$

where $N$ is the number of elements and $v^*$ is the target volume fraction [2510.23667].

The paper also gives the corresponding continuous statement on a domain $\Omega$ with Dirichlet conditions:

$$
\mathcal{L}\bigl(\rho(x),u(x)\bigr)=f(x)\quad \text{in } \Omega,\qquad
u(x)=g(x)\quad \text{on } \mathcal{D}\subset \overline{\Omega},
$$

together with the constrained optimization problem

$$
\min_{\rho(\cdot)} J\bigl(u(\rho),\rho\bigr)
\quad
\text{s.t.}\;
\mathcal{L}(\rho,u)=f,\;
u=g \text{ on } \mathcal{D},\;
\int_{\Omega}\rho\,dx \le V_{\max}.
$$

All physics assumes linear elasticity, and the resulting samples are stated to satisfy equilibrium and volume-fraction constraints [2510.23667].

The source paper characterizes the generator as a standard SIMP-style iterative solver with FEA at each step and convergence under the volume constraint [2510.23667]. It notes that regularization typical of SIMP, such as density filtering or projection to mitigate checkerboarding and control length scales, may be applied, though exact parameterization is not the focus of the dataset description [2510.23667]. A typical SIMP run in the paper’s speed comparison takes on the order of 150 iterations to converge for $64 \times 64$ to $256 \times 256$ problems, which is presented as context for the cost of producing ground truth [2510.23667].

## 4. Data representation and conditioning variables

OpenTO stores topology fields $\rho \in [0,1]$ on rectangular grids at native resolution and aspect ratio, so individual samples are variable-sized arrays rather than being forced into a single fixed raster [2510.23667]. This representation is central to the dataset’s intended use in resolution-free autoencoding and implicit neural-field decoding.

For the 894,000 labeled samples, each problem specification includes four groups of conditioning information: the aspect ratio $a$ and cell or pixel size $s$; the target volume fraction $\mathrm{VF}$; the force set $S_{\mathrm{force}}$, consisting of point coordinates plus 2D load vectors; and the fixture set $S_{\mathrm{boundary}}$, consisting of point coordinates plus binary degree-of-freedom fix indicators [2510.23667]. Because the force and fixture sets are variable-length, the associated OAT model encodes them with BPOM, an order-invariant MLP, while separate small MLPs encode $\mathrm{VF}$, $s$, and $a$ [2510.23667].

The train/validation/test organization is asymmetric. The paper states that 5,000 fully randomized problems are held out for testing, while the rest of the corpus constitutes the training pool for pretraining and conditional generation [2510.23667]. The unlabeled 1.3M+ layouts are used to pretrain the autoencoder, and the labeled 894k subset trains the conditional latent diffusion model [2510.23667].

This design implies that OpenTO separates two learning problems: learning a resolution- and shape-agnostic latent geometry prior from all layouts, and learning conditional generation from fully specified mechanics problems using the labeled subset. The paper does not frame this as a formal hierarchy, but the split is structurally aligned with that interpretation.

## 5. Relationship to OAT and benchmark role

OpenTO is inseparable from the development of OAT, “Optimize Any Topology,” which the paper presents as a foundation-model framework for shape- and resolution-free structural topology optimization [2510.23667]. In that framework, a resolution- and shape-agnostic autoencoder provides fixed-dimensional latents for variable-resolution inputs, an implicit neural-field renderer decodes layouts at arbitrary resolutions, and a conditional latent diffusion model predicts optimized structures from encoded problem specifications [2510.23667].

The conditioning embedding used by OAT is given as

$$
P = \operatorname{concat}(
\operatorname{BPOM}_{\text{b}}(S_{\text{boundary}}),
\operatorname{BPOM}_{\text{f}}(S_{\text{force}}),
\operatorname{MLP}_{\text{vf}}(\mathrm{VF}),
\operatorname{MLP}_{\text{cell}}(s),
\operatorname{MLP}_{\text{ratio}}(a)).
$$

The autoencoder is trained with an $L_1$ reconstruction loss,

$$
L_{AE} = \lVert \tilde{T} - T_{\text{GT}} \rVert_1,
$$

and the latent diffusion model uses a velocity-parameterized objective with classifier-free guidance [2510.23667]. During training, conditions are dropped for 50% of samples to enable guidance [2510.23667].

The paper attributes several capabilities of OAT directly to OpenTO’s breadth. The unlabeled portion supports learning resolution- and shape-agnostic latents and high-fidelity reconstructions across resolutions from $64 \times 64$ to $256 \times 256$ and aspect ratios up to $10\!:\!1$, while the labeled portion supplies the diversity of boundary conditions and loads required for robust permutation-invariant conditioning on unseen fixtures, loads, and domain geometries [2510.23667].

OpenTO also serves as an explicit generalization benchmark. Its held-out test split contains 5,000 fully randomized problems, and the paper reports that even the best prior shape- and resolution-dependent models struggle on these randomized settings [2510.23667]. That role is methodologically important: the dataset is not only training data, but also a stress test against overfitting to conventional square-grid, boundary-loaded benchmark families.

## 6. Reported impact, scope limits, and future directions

In the reported experiments built on OpenTO, OAT achieves up to an order-of-magnitude, approximately 90%, reduction in mean compliance error relative to the best prior models on canonical benchmarks, while adhering more tightly to volume constraints [2510.23667]. The paper also reports sub-1 second inference on a single GPU with nearly constant runtime from $64 \times 64$ to $256 \times 256$, which it attributes to latent diffusion combined with the implicit renderer [2510.23667]. These results are claims about OAT rather than the dataset alone, but they function as evidence that OpenTO’s scale and diversity are sufficient to support foundation-model training for physics-aware inverse design.

The scope of OpenTO remains deliberately narrow in physical terms. It targets 2D minimum-compliance topology optimization under linear elasticity and does not include stress or buckling constraints, multi-physics settings such as thermoelasticity, or 3D problems [2510.23667]. The paper further notes that generative models trained on such data can still fail through small misplacements near fixtures or loads, producing high compliance despite apparently plausible layouts [2510.23667]. It reports that OAT’s failure rate on fully random problems drops substantially with a few SIMP refinement steps, for example 10 iterations, which indicates that learned prediction and classical refinement remain complementary [2510.23667].

The future directions proposed in the source are dataset-centered as much as model-centered. These include extension to 3D and multi-physics settings, larger labeled subsets with finer-grained metadata, incorporation of manufacturing constraints such as length-scale and overhang restrictions, robust-design variants, and exploration of reinforcement learning or preference optimization to reduce failure rates and align generation more closely with optimizer feedback [2510.23667]. A plausible implication is that OpenTO is intended not as a terminal benchmark, but as the first large-scale substrate for a broader family of learned topology optimization systems.

OpenTO is released open-source through the OptimizeAnyTopology repository, with the paper directing readers to the repository’s LICENSE file for exact terms [2510.23667]. Its significance lies in the combination of scale, randomized mechanics specifications, native variable-resolution representation, and explicit benchmarking for out-of-distribution generalization—features that collectively reposition dataset design as a primary determinant of what learned topology optimization systems can generalize to in practice [2510.23667].

Source: https://www.emergentmind.com/topics/opento