• Title/Summary/Keyword: 클로스 시뮬레이션

Search Result 2, Processing Time 0.015 seconds

Optimization of the Cloth Simulation Pipeline in Production of 3D Computer Animation (3D 컴퓨터 애니메이션 제작에서 Cloth Simulation 을 위한 제작파이프라인의 최적화)

  • Kwak, Dong-Min;Choi, Chul-Yong;Kim, Ki-Hong;Lee, Dong-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.198-207
    • /
    • 2009
  • Recently, it was possible to represent the realistic clothes in the cloth simulation along with growth of 3D computer animation such as visual contents. In addition, because of the development of H/W(Hardware) and S/W(Software), the accessibility and participation are growing. However, in order to make the image of high quality of 3D animation, the optimized production pipeline was need. In this paper, in order to overcome the limitation of exiting 3D computer animation production pipeline, we propose the optimized production pipeline of the cloth simulation. Our production pipeline makes the optimization arrangement in consideration of the mobility in order to supplement the related structure limit toward each part of the existing pipeline. Moreover, by utilizing the dummy cloth the association nature with the animation part is solved and a performance is improved. The proposal pipeline actually introduced to the animation production. And then we can improve the performance production time and production manpower consumption. Consequently, our pipeline is guaranteed an optimized work by emphasizing a connection in the direct image production.

The analysis and modeling of the performance improvement method of multistage interconnection networks (다단상호연결네트웍의 성능 향상 기법의 해석적 모델링 및 분석 평가)

  • 문영성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.6
    • /
    • pp.1490-1495
    • /
    • 1998
  • Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, a general analytical model for the point-to-point blocking probability of the call-packing scheme applied to Clos networks is developed. By introducing a new parameter called the degree of call packing, the model can correctly estimate the blocking probability of both call-packing and random routing schemes. The model is verified by computer simulation for various size networks and traffic conditions.

  • PDF