Towards simulating cloth dynamics using interacting particles

International Journal of Clothing Science and Technology

Volumn 8, Issue 3, 1996, Pages 75-94

  House, Donald H ^a   Devaul, Richard W ^a   Breen, David E ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b Research Centre (ECRC) 1   (Germany)

Author keywords

Algorithms; Fabric; Modelling; Performance

Indexed keywords

EID: 0002448262     PISSN: 09556222     EISSN: None     Source Type: Journal    
DOI: 10.1108/09556229610147959     Document Type: Article

References (21)

1. Collier, J.R., Collier, B.J., O'Toole, G. and Sargand, S.M., "Drape prediction by means of finite-element analysis", Journal oftlie Textile Institute, Vol. 82 No. 1, 1991, pp. 96-107.
2. Eischen, J.W., Kim, Y.G., Clapp, T.G. and Ghosh, T.K., "Computer simulation of the large motions of fabric structures", Proceedings of the 15th SECTAM Conference, College of Engineering at Georgia Institute of Technology, Atlanta, GA, 1990, pp. 119-26.
3. Lloyd, D.W., "The analysis of complex fabric deformations", in Hearle, J.W.S., Thwaites, J.J. and Amirbayat, J. (Eds), Mechanics of Flexible Fibre Assemblies, Sijthoff & Noordhoff, Alphen aan den Rijn, 1980, pp. 311-42.
4. Shanahan, W.J., Lloyd, D.W. and Hearle, J.W.S., "Characterizing the elastic behavior of textile fabrics in complex deformation", Textile Research Journal, Vol. 48, 1978, pp. 495-505.
5. Breen, D.E., House, D.H. and Getto, P.H., "A physically-based particle model of woven cloth", The Visual Computer, Vol. 8 No. 5-6, June 1992, pp. 264-77.
6. Breen, D.E., House, D.H. and Wozny, M.J., "Predicting the drape of woven cloth using interacting particles", Proceedings of SIGGRAPH Computer Graphics, Annual conference series, ACM Press, New York, NY, 1994.
7. Cusick, G.E., "The resistance of fabrics to shearing forces", Journal of the Textile Institute, Vol. 52 No. 9, September 1961, pp. T395-T406.
8. Green, A.E. and Zerna, W., Theoretical Elasticity, Oxford University Press, London, 1968.
9. Terzopoulos, D. and Fleischer, K., "Deformable models", The Visual Computer, Vol. 4, 1988, pp. 306-31.
10. Carignan, M., Yang, Y., Magnenat-Thalmann, N. and Thalmann, D., "Dressing animated synthetic actors with complex deformable clothes", Proceedings of SIGGRAPH, Computer Graphics, Vol. 26 No. 2, 1992, ACM Press, New York, NY, pp. 99-104.
11. Breen, D.E., Tonnesen, D. and Gates, B. (Eds), Particle Systems Bibliography, Rensselaer Design Research Center Technical Report TR-92029, Rensselaer Polytechnic Institute, December 1992.
12. Breen, D.E., A Survey of Cloth Modeling Research, Rensselaer Design Research Center Technical Report TR-92030, Rensselaer Polytechnic Institute, July 1993.
13. Breen, D.E., A Particle-based Model for Simulating the Draping Behavior of Woven Cloth, PhD thesis, Rensselaer Design Research Center Technical Report TR-93011, Rensselaer Polytechnic Institute, June 1993.
14. House, D.H., Breen, D.E. and Getto, P.H., "On the dynamic simulation of physically-based particle-system models", Third Eurographics Workshop on Animation and Simulation Proceedings, Cambridge, September 1992, Eurographics Society.
15. Kawabata, S., The Standardization and Analysis of Hand Evaluation, The Textile Machinery Society of Japan, Osaka, 1980.
16. Breen, D.E., House, D.H. and Wozny, M.J., "A particle-based model for simulating the draping behavior of woven cloth", Textile Research Journal, Vol. 64 No. 11, 1994, pp. 663-85.
17. Witkin, A., "Constrained dynamics", SIGGRAPH 95 Course Notes (Course 34 Physically Based Modeling), 1995, pp. F1-F12.
18. Witkin, A., Gleicher, M. and Welch, W., "Interactive dynamics", Computer Graphics (Proceedings of the Symposium on 3-D Interactive Graphics), Vol. 24 No. 2, 1990, pp. 11-21.
19. Press, W., Teukolsky, S., Vetterling, W. and Flannery, B., Numerical Recipes in C, The Art of Scientific Computing, 2nd ed., Cambridge University Press, Cambridge, 1992.
20. The notation O[f(N)] is commonly used in algorithm analysis to denote an algorithm whose computational time demand per component increases as the function/of the number of computational elements N. This is usually an asymptotic relation that holds strictly only as N approaches infinity. However it is generally a useful measure in determining how an algorithm's performance can be expected to degrade as the number of computational elements increases.
21. Strictly speaking, interactive speed is considered to be at the TV frame-rate of 30 complete solutions per second. However, rates as low as two or more solutions per second are still useful for many interactive tasks.