TY - CONF
AB - We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.
AU - Baig, Mirza Ahad
AU - Hendler, Danny
AU - Milani, Alessia
AU - Travers, Corentin
ID - 8382
SN - 9781450375825
T2 - Proceedings of the 39th Symposium on Principles of Distributed Computing
TI - Long-lived snapshots with polylogarithmic amortized step complexity
ER -
TY - CONF
AB - We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.
AU - Alistarh, Dan-Adrian
AU - Aspnes, James
AU - Ellen, Faith
AU - Gelashvili, Rati
AU - Zhu, Leqi
ID - 8383
SN - 9781450375825
T2 - Proceedings of the 39th Symposium on Principles of Distributed Computing
TI - Brief Announcement: Why Extension-Based Proofs Fail
ER -
TY - JOUR
AB - Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.
AU - Ishida, Sadashige
AU - Synak, Peter
AU - Narita, Fumiya
AU - Hachisuka, Toshiya
AU - Wojtan, Christopher J
ID - 8384
IS - 4
JF - ACM Transactions on Graphics
SN - 07300301
TI - A model for soap film dynamics with evolving thickness
VL - 39
ER -
TY - JOUR
AB - We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver.
AU - Sperl, Georg
AU - Narain, Rahul
AU - Wojtan, Christopher J
ID - 8385
IS - 4
JF - ACM Transactions on Graphics
SN - 07300301
TI - Homogenized yarn-level cloth
VL - 39
ER -
TY - THES
AB - Form versus function is a long-standing debate in various design-related fields, such as architecture as well as graphic and industrial design. A good design that balances form and function often requires considerable human effort and collaboration among experts from different professional fields. Computational design tools provide a new paradigm for designing functional objects. In computational design, form and function are represented as mathematical
quantities, with the help of numerical and combinatorial algorithms, they can assist even novice users in designing versatile models that exhibit their desired functionality. This thesis presents three disparate research studies on the computational design of functional objects: The appearance of 3d print—we optimize the volumetric material distribution for faithfully replicating colored surface texture in 3d printing; the dynamic motion of mechanical structures—
our design system helps the novice user to retarget various mechanical templates with different functionality to complex 3d shapes; and a more abstract functionality, multistability—our algorithm automatically generates models that exhibit multiple stable target poses. For each of these cases, our computational design tools not only ensure the functionality of the results but also permit the user aesthetic freedom over the form. Moreover, fabrication constraints
were taken into account, which allow for the immediate creation of physical realization via 3D printing or laser cutting.
AU - Zhang, Ran
ID - 8386
SN - 2663-337X
TI - Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability
ER -
TY - THES
AB - Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction
for tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually
dissimilar domains.
AU - Royer, Amélie
ID - 8390
SN - 978-3-99078-007-7
TI - Leveraging structure in Computer Vision tasks for flexible Deep Learning models
ER -
TY - JOUR
AB - Background: The mitochondrial pyruvate carrier (MPC) plays a central role in energy metabolism by transporting pyruvate across the inner mitochondrial membrane. Its heterodimeric composition and homology to SWEET and semiSWEET transporters set the MPC apart from the canonical mitochondrial carrier family (named MCF or SLC25). The import of the canonical carriers is mediated by the carrier translocase of the inner membrane (TIM22) pathway and is dependent on their structure, which features an even number of transmembrane segments and both termini in the intermembrane space. The import pathway of MPC proteins has not been elucidated. The odd number of transmembrane segments and positioning of the N-terminus in the matrix argues against an import via the TIM22 carrier pathway but favors an import via the flexible presequence pathway.
Results: Here, we systematically analyzed the import pathways of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible presequence pathway, yeast MPC proteins with an odd number of transmembrane segments and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic motifs that are also required for the interaction with canonical carrier proteins.
Conclusions: The carrier pathway can import paired and non-paired transmembrane helices and translocate N-termini to either side of the mitochondrial inner membrane, revealing an unexpected versatility of the mitochondrial import pathway for non-cleavable inner membrane proteins.
AU - Rampelt, Heike
AU - Sucec, Iva
AU - Bersch, Beate
AU - Horten, Patrick
AU - Perschil, Inge
AU - Martinou, Jean-Claude
AU - van der Laan, Martin
AU - Wiedemann, Nils
AU - Schanda, Paul
AU - Pfanner, Nikolaus
ID - 8402
JF - BMC Biology
KW - Biotechnology
KW - Plant Science
KW - General Biochemistry
KW - Genetics and Molecular Biology
KW - Developmental Biology
KW - Cell Biology
KW - Physiology
KW - Ecology
KW - Evolution
KW - Behavior and Systematics
KW - Structural Biology
KW - General Agricultural and Biological Sciences
SN - 1741-7007
TI - The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments
VL - 18
ER -
TY - GEN
AB - Chaperones are essential for assisting protein folding, and for transferring poorly soluble proteins to their functional locations within cells. Hydrophobic interactions drive promiscuous chaperone–client binding, but our understanding of how additional interactions enable client specificity is sparse. Here we decipher what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23 which has an additional disordered hydrophilic domain. Combining NMR, SAXS and molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with the hydrophilic part of its client, but its interactions to the transmembrane part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance of promiscuity vs. specificity.
AU - Sučec, Iva
AU - Wang, Yong
AU - Dakhlaoui, Ons
AU - Weinhäupl, Katharina
AU - Jores, Tobias
AU - Costa, Doriane
AU - Hessel, Audrey
AU - Brennich, Martha
AU - Rapaport, Doron
AU - Lindorff-Larsen, Kresten
AU - Bersch, Beate
AU - Schanda, Paul
ID - 8403
T2 - bioRxiv
TI - Structural basis of client specificity in mitochondrial membrane-protein chaperones
ER -
TY - GEN
AB - The mitochondrial Tim chaperones are responsible for the transport of membrane proteins across the inter-membrane space to the inner and outer mitochondrial membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9 and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex is the anchor point at the inner-membrane insertase complex TIM22. The mechanism of client transport by TIM9·10 has been resolved recently, but the structure and subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore, the assembly process of the hexameric TIM chaperones from its subunits remained elusive. We investigate the structural and dynamical properties of the Tim subunits, and show that they are highly dynamic. In their non-assembled form, the subunits behave as intrinsically disordered proteins; when the conserved cysteines of the CX3C-Xn-CX3C motifs are formed, short marginally stable α-helices are formed, which are only fully stabilized upon hexamer formation to the mature chaperone. Subunits are in equilibrium between their hexamer-embedded and a free form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray scattering and MD simulation data allow us to derive a structural model of the TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.
AU - Weinhäupl, Katharina
AU - Wang, Yong
AU - Hessel, Audrey
AU - Brennich, Martha
AU - Lindorff-Larsen, Kresten
AU - Schanda, Paul
ID - 8404
T2 - bioRxiv
TI - Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone
ER -
TY - BOOK
AB - Arnold diffusion, which concerns the appearance of chaos in classical mechanics, is one of the most important problems in the fields of dynamical systems and mathematical physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted the efforts of some of the most prominent researchers in mathematics. The question is whether a typical perturbation of a particular system will result in chaotic or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that that there is topological instability for typical perturbations of five-dimensional integrable systems (two and a half degrees of freedom).
This proof realizes a plan John Mather announced in 2003 but was unable to complete before his death. Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach, tying together normal forms theory, hyperbolic theory, Mather theory, and weak KAM theory. Offering a complete, clean, and modern explanation of the steps involved in the proof, and a clear account of background material, this book is designed to be accessible to students as well as researchers. The result is a critical contribution to mathematical physics and dynamical systems, especially Hamiltonian systems.
AU - Kaloshin, Vadim
AU - Zhang, Ke
ID - 8414
SN - 9780691202532
TI - Arnold diffusion for smooth systems of two and a half degrees of freedom
VL - 208
ER -
TY - GEN
AB - Due to the complexity of linkage disequilibrium (LD) and gene regulation, understanding the genetic basis of common complex traits remains a major challenge. We develop a Bayesian model (BayesRR-RC) implemented in a hybrid-parallel algorithm that scales to whole-genome sequence data on many hundreds of thousands of individuals, taking 22 seconds per iteration to estimate the inclusion probabilities and effect sizes of 8.4 million markers and 78 SNP-heritability parameters in the UK Biobank. Unlike naive penalized regression or mixed-linear model approaches, BayesRR-RC accurately estimates annotation-specific genetic architecture, determines the underlying joint effect size distribution and provides a probabilistic determination of association within marker groups in a single step. Of the genetic variation captured for height, body mass index, cardiovascular disease, and type-2 diabetes in the UK Biobank, only ≤ 10% is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, up to 40% to intronic regions, and 22-28% to distal 10-500kb upstream regions. ≥60% of the variance contributed by these exonic, intronic and distal 10-500kb regions is underlain by many thousands of common variants, each with larger average effect sizes compared to the rest of the genome. We also find differences in the relationship between effect size and heterozygosity across annotation groups and across traits. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance for just these four traits. In the Estonian Biobank, we show improved prediction accuracy over other approaches and generate a posterior predictive distribution for each individual.
AU - Patxot, Marion
AU - Trejo Banos, Daniel
AU - Kousathanas, Athanasios
AU - Orliac, Etienne J
AU - Ojavee, Sven E
AU - Moser, Gerhard
AU - Sidorenko, Julia
AU - Kutalik, Zoltan
AU - Magi, Reedik
AU - Visscher, Peter M
AU - Ronnegard, Lars
AU - Robinson, Matthew Richard
ID - 8429
T2 - medRxiv
TI - Probabilistic inference of the genetic architecture of functional enrichment of complex traits
ER -
TY - JOUR
AB - Practical quantum networks require low-loss and noise-resilient optical interconnects as well as non-Gaussian resources for entanglement distillation and distributed quantum computation. The latter could be provided by superconducting circuits but existing solutions to interface the microwave and optical domains lack either scalability or efficiency, and in most cases the conversion noise is not known. In this work we utilize the unique opportunities of silicon photonics, cavity optomechanics and superconducting circuits to demonstrate a fully integrated, coherent transducer interfacing the microwave X and the telecom S bands with a total (internal) bidirectional transduction efficiency of 1.2% (135%) at millikelvin temperatures. The coupling relies solely on the radiation pressure interaction mediated by the femtometer-scale motion of two silicon nanobeams reaching a Vπ as low as 16 μV for sub-nanowatt pump powers. Without the associated optomechanical gain, we achieve a total (internal) pure conversion efficiency of up to 0.019% (1.6%), relevant for future noise-free operation on this qubit-compatible platform.
AU - Arnold, Georg M
AU - Wulf, Matthias
AU - Barzanjeh, Shabir
AU - Redchenko, Elena
AU - Rueda Sanchez, Alfredo R
AU - Hease, William J
AU - Hassani, Farid
AU - Fink, Johannes M
ID - 8529
JF - Nature Communications
KW - General Biochemistry
KW - Genetics and Molecular Biology
KW - General Physics and Astronomy
KW - General Chemistry
SN - 2041-1723
TI - Converting microwave and telecom photons with a silicon photonic nanomechanical interface
VL - 11
ER -
TY - CONF
AB - Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Jecker, Ismael R
AU - Svoboda, Jakub
ID - 8533
SN - 18688969
T2 - 45th International Symposium on Mathematical Foundations of Computer Science
TI - Simplified game of life: Algorithms and complexity
VL - 170
ER -
TY - CONF
AB - A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.
AU - Jecker, Ismael R
AU - Kupferman, Orna
AU - Mazzocchi, Nicolas
ID - 8534
SN - 18688969
T2 - 45th International Symposium on Mathematical Foundations of Computer Science
TI - Unary prime languages
VL - 170
ER -
TY - JOUR
AB - We propose a method to enhance the visual detail of a water surface simulation. Our method works as a post-processing step which takes a simulation as input and increases its apparent resolution by simulating many detailed Lagrangian water waves on top of it. We extend linear water wave theory to work in non-planar domains which deform over time, and we discretize the theory using Lagrangian wave packets attached to spline curves. The method is numerically stable and trivially parallelizable, and it produces high frequency ripples with dispersive wave-like behaviors customized to the underlying fluid simulation.
AU - Skrivan, Tomas
AU - Soderstrom, Andreas
AU - Johansson, John
AU - Sprenger, Christoph
AU - Museth, Ken
AU - Wojtan, Christopher J
ID - 8535
IS - 4
JF - ACM Transactions on Graphics
SN - 07300301
TI - Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces
VL - 39
ER -
TY - CONF
AB - This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.
AU - Mondelli, Marco
AU - Hashemi, Seyyed Ali
AU - Cioffi, John
AU - Goldsmith, Andrea
ID - 8536
SN - 21578095
T2 - IEEE International Symposium on Information Theory - Proceedings
TI - Simplified successive cancellation decoding of polar codes has sublinear latency
VL - 2020-June
ER -
TY - JOUR
AB - We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.
AU - Akopyan, Arseniy
AU - Schwartz, Richard
AU - Tabachnikov, Serge
ID - 8538
JF - European Journal of Mathematics
SN - 2199675X
TI - Billiards in ellipses revisited
ER -
TY - JOUR
AB - Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.
AU - Su, C.
AU - Zhao, Gufang
AU - Zhong, C.
ID - 8539
IS - 3
JF - Annales Scientifiques de l'Ecole Normale Superieure
SN - 0012-9593
TI - On the K-theory stable bases of the springer resolution
VL - 53
ER -
TY - GEN
AB - The infiltration of immune cells into tissues underlies the establishment of tissue resident macrophages, and responses to infections and tumors. Yet the mechanisms immune cells utilize to negotiate tissue barriers in living organisms are not well understood, and a role for cortical actin has not been examined. Here we find that the tissue invasion of Drosophila macrophages, also known as plasmatocytes or hemocytes, utilizes enhanced cortical F-actin levels stimulated by the Drosophila member of the fos proto oncogene transcription factor family (Dfos, Kayak). RNA sequencing analysis and live imaging show that Dfos enhances F-actin levels around the entire macrophage surface by increasing mRNA levels of the membrane spanning molecular scaffold tetraspanin TM4SF, and the actin cross-linking filamin Cheerio which are themselves required for invasion. Cortical F-actin levels are critical as expressing a dominant active form of Diaphanous, a actin polymerizing Formin, can rescue the Dfos Dominant Negative macrophage invasion defect. In vivo imaging shows that Dfos is required to enhance the efficiency of the initial phases of macrophage tissue entry. Genetic evidence argues that this Dfos-induced program in macrophages counteracts the constraint produced by the tension of surrounding tissues and buffers the mechanical properties of the macrophage nucleus from affecting tissue entry. We thus identify tuning the cortical actin cytoskeleton through Dfos as a key process allowing efficient forward movement of an immune cell into surrounding tissues.
AU - Belyaeva, Vera
AU - Wachner, Stephanie
AU - Gridchyn, Igor
AU - Linder, Markus
AU - Emtenani, Shamsi
AU - György, Attila
AU - Sibilia, Maria
AU - Siekhaus, Daria E
ID - 8557
T2 - bioRxiv
TI - Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance
ER -
TY - JOUR
AB - Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.
However, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We
propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass
limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable
configurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface.
AU - Gavriil, Konstantinos
AU - Guseinov, Ruslan
AU - Perez Rodriguez, Jesus
AU - Pellis, Davide
AU - Henderson, Paul M
AU - Rist, Florian
AU - Pottmann, Helmut
AU - Bickel, Bernd
ID - 8562
IS - 6
JF - ACM Transactions on Graphics
TI - Computational design of cold bent glass façades
VL - 39
ER -