![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Computer-Aided Design, Volume 139
Volume 139, October 2021
- Hyowon Suh
, Hyeong-Seok Ko:
Optimal Stitch Forming Line Identification for Attaching Patches on Non-Developable Clothing Surfaces. 103051 - Tomas Hermansson
, Edvin Åblad
:
Routing of curves with piecewise constant curvature applied to routing of preformed hoses. 103067 - Jonàs Martínez
:
Random Auxetic Porous Materials from Parametric Growth Processes. 103069 - Qiang Zou:
Length-optimal tool path planning for freeform surfaces with preferred feed directions based on Poisson formulation. 103072 - Thein Lin Aung
, Ninshu Ma
:
Isogeometric Analysis and Bayesian Optimization on Efficient Weld Geometry Design for Remarkable Stress Concentration Reduction. 103074 - Hugo M. Verhelst
, Matthias Möller, J. Henk Den Besten, Angelos Mantzaflaris, Mirek Kaminski:
Stretch-Based Hyperelastic Material Formulations for Isogeometric Kirchhoff-Love Shells with Application to Wrinkling. 103075 - Zhongyuan Liu, Jian-Ping Su
, Hao Liu, Chunyang Ye, Ligang Liu, Xiao-Ming Fu
:
Error-bounded Edge-based Remeshing of High-order Tetrahedral Meshes. 103080 - David Desobry, Yoann Coudert-Osmont, Etienne Corman, Nicolas Ray, Dmitry Sokolov
:
Designing 2D and 3D Non-Orthogonal Frame Fields. 103081 - Somayeh Kargaran, Bert Jüttler
, Thomas Takacs
:
IGA Using Offset-based Overlapping Domain Parameterizations. 103087
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.