Approximate transformation of an arbitrary curved surface into a plane using dynamic programming (Q2277758)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate transformation of an arbitrary curved surface into a plane using dynamic programming |
scientific article; zbMATH DE number 4197249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate transformation of an arbitrary curved surface into a plane using dynamic programming |
scientific article; zbMATH DE number 4197249 |
Statements
Approximate transformation of an arbitrary curved surface into a plane using dynamic programming (English)
0 references
1991
0 references
The authors outline a method to model a curved surface by small triangular patches that can be mapped onto plane triangles with small enough error. They consider this as a stress problem and the total stress replaces curvature and leads to a minimization problem for total stress. The procedure is in two steps, coarse and fine approximation. \{There seems to be no algorithm proposed to determine the number of subdivisions to be introduced in a coarse cell, and hence no dependence on curvature properties that could significantly reduce the number of finite elements necessary.\}
0 references
computer aided design
0 references
design engineering
0 references
dynamic programming
0 references
multi- stage decision processes
0 references
curved surface
0 references
0.8673613
0 references
0 references
0 references
0.8619634
0 references
0 references
0.8560585
0 references
0.8558543
0 references
0.8557993
0 references
0 references