𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for draping fabrics on doubly-curved surfaces

✍ Scribed by F. Van Der Weeën

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
538 KB
Volume
31
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

Three algorithms for draping biaxially woven fabrics on arbitrarily curved surfaces are presented and compared for numerical accuracy and computational expense. The first one minimizes the elastic energy in each fabric cell, while the two others are based on placing a net of interlocked and inextensible fibres on the surface along geodesic lines. A benchmark shows that the minimum energy technique performs the best and is also the most promising for further optimization in terms of numerical quadrature formulae.

📜 SIMILAR VOLUMES

Hidden-line algorithm for curved surface
Hidden-line algorithm for curved surfaces
✍ L. Li 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A hidden-line algorithm for displaying curved surfaces by line drawing is presented. The algorithm divides the screen plane into small rectangles, unlike Ohno's algorithm, which divides the screen space into small 3D boxes and exploits quadrilateral coherence and depth coherence. The present algorit

Knot-removal algorithms for NURBS curves
Knot-removal algorithms for NURBS curves and surfaces
✍ W. Tiller 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 647 KB

The paper presents pseudocode aloorithms, c-lanouaoe code, and error analysis for removino knots from rational B-spline curves and surfaces. Efficient and easy-to-use aloorithms are presented that, with one call, remove all the removable knots from a B-spline curve or surface.

An algorithm for silhouette of curved su
An algorithm for silhouette of curved surfaces based on graphical relations
✍ Luisa Bonfiglioli 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 504 KB

The proposed algorithm d/splays the projected surface F as a quadrilateral grid of straight segments, g; any one of these can be part of the silhouette if, and only if, the two patches connected along g lie on the same side of it. The same segment g is drawn, if it is not hidden by remote patches. T

Curve and Surface Generation and Refinem
Curve and Surface Generation and Refinement Based on a High Speed Derivative Algorithm
✍ P.V. Sankar; M.J. Silbermann; L.A. Ferrari 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 376 KB

We propose an efficient algorithm for the refinement of curves and surfaces using simple knot B-splines. We develop a high speed algorithm for the computation of the \(r\) th derivative of an \(r\) th order spline and demonstrate that the inverse of this algorithm leads to an efficient refinement al