SearcharxivSearch

arXiv · 2606.29419

EASE: Parametric garment design with explicit and local ease control

Abstract

Garment fit and comfort depend critically on ease, the local allowance of excess material relative to the body. In existing design pipelines, ease is typically a byproduct of geometry or simulation rather than an independent design variable, making it difficult to specify, edit, transfer, or redistribute without re-running simulation or optimization. We propose a garment representation that embeds meshes directly on the surface of a parametric human body model and represents ease explicitly as spatially varying, anisotropic per-triangle scales. These scales act as primary design variables, decoupling the specification of material allowance from its physical deformation. Given a design specified by parametric and user-defined surface cuts together with local scale fields, we optimize sewing patterns that enforce the prescribed ease distribution while satisfying geometric and seam constraints. The representation enables three capabilities that are unavailable without explicit ease control: (1) direct specification and editing of local material allowance on the body surface; (2) intent-preserving transfer to new body shapes that reproduces the specified ease distribution without re-running simulation; and (3) intent-modifying pose adaptation that redistributes ease to relieve strain in high-stretch regions. We verify each of these experimentally: ease is closely retained after optimization, excessive strain is significantly mitigated for target poses, and the ease distribution is accurately transferred to target shapes. The approach is implemented as a virtual try-on framework, with physics-based cloth simulation used for final garment visualization. We will publicly release our framework and detailed documentation.

Explore related subjects

Keep this discovery

BibTeXRIS

Kristijan Bartol, Frieda Hentschel, Nataliya Sadretdinova, Benjamin Russig, Melinos Averkiou, Yordan Kyosev, Stefan Gumhold. 2026-06-28. EASE: Parametric garment design with explicit and local ease control. https://doi.org/10.1016/j.cag.2026.104644

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG