http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Carufel, J. L. (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Exploration of the body–garment relationship theory through the analysis of a sheath dress
Robin Carufel,Elizabeth Bye 한국의류학회 2020 Fashion and Textiles Vol.7 No.1
The apparel industry is replete with assumptions regarding the body-garment relationship. Traditional anthropometry focuses on linear body measurements, which are inadequate to describe and classify the human body-form for apparel pattern development. To enable the development of a body-form based block system, this case study explored the body-garment relationship for a sheath dress to determine if apparel block shapes could be categorized based on distinct body-form variations. A modified version of Gazzuolo’s (1985) body-garment relationship theory guided the development and analysis of the study. Pattern blocks were fit to 39 female subjects, with 16 dimensions extracted from specific pattern components and graphed to reveal between one and five groups per dimension. Visual analysis of the sample’s body scans revealed 27 body-form variations with 99 categorical descriptions. Categorical descriptions were compared to the dimensional values resulting in ten suggestions for a body-form based block system, and seventeen assumptions that require further analysis. In conclusion, this case study discovered multiple body-form variations across a single size, but block shapes could not be identified due to the wide variation in the sample. Future studies should assess a statistically significant sample of individuals with in-depth analysis of a single body region to determine if there are generalizable bodyform variations across the population.
-
The geodesic 2-center problem in a simple polygon
Oh, Eunjin,De Carufel, Jean-Lou,Ahn, Hee-Kap Elsevier 2018 Computational geometry Vol.74 No.-
<P><B>Abstract</B></P> <P>In the <I>geodesic</I> 2<I>-center problem in a simple polygon</I> with <I>n</I> vertices, we find a set <I>S</I> of two points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in <I>S</I>. In this paper, we present an O ( <SUP> n 2 </SUP> <SUP> log 2 </SUP> n ) -time algorithm for this problem using O ( n ) space.</P>
-
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Ahn, H. K.,Barba, L.,Bose, P.,Carufel, J. L.,Korman, M.,Oh, E. Springer Science + Business Media 2016 Discrete & Computational Geometry Vol.56 No.4
<P>Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P. The geodesic center of P is the unique point in P that minimizes the largest geodesic distance to all other points of P. In 1989, Pollack et al. (Discrete Comput Geom 4(1): 611-626, 1989) showed an -time algorithm that computes the geodesic center of P. Since then, a longstanding question has been whether this running time can be improved. In this paper we affirmatively answer this question and present a deterministic linear-time algorithm to solve this problem.</P>
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
