• 제목/요약/키워드: Geometric Shape Morphing

검색결과 5건 처리시간 0.018초

민코프스키 덧셈 연산에 근거한 기하 도형의 모핑 제어 방법 (Interactive Control of Geometric Shape Morphing based on Minkowski Sum)

  • Lee, J.-H.;Lee, J. Y.;Kim, H.;Kim, H. S.
    • 한국CDE학회논문집
    • /
    • 제7권4호
    • /
    • pp.269-279
    • /
    • 2002
  • Geometric shape morphing is an interesting geometric operation that interpolates two geometric shapes to generate in-betweens. It is well known that Minkowski operations can be used to test and build collision-free motion paths and to modify shapes in digital image processing. In this paper, we present a new geometric modeling technique to control the morphing on geometric shapes based on Minkowski sum. The basic idea develops from the linear interpolation on two geometric shapes where the traditional algebraic sum is replaced by Minkowski sum. We extend this scheme into a Bezier-like control structure with multiple control shapes, which enables the interactive control over the intermediate shapes during the morphing sequence as in the traditional CAGD curve/surface editing. Moreover, we apply the theory of blossoming to our control structure, whereby our control structure becomes even more flexible and general. In this paper, we present mathematical models of control structure, their properties, and computational issues with examples.

방향지도 기반 기하모핑의 효율적인 계산 및 제어 방법 (Efficient Computation and Control of Geometric Shape Morphing based on Direction Map)

  • 이주행;김현;김형선
    • 한국CDE학회논문집
    • /
    • 제8권4호
    • /
    • pp.243-253
    • /
    • 2003
  • This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.

Morphing Wing Mechanism Using an SMA Wire Actuator

  • Kang, Woo-Ram;Kim, Eun-Ho;Jeong, Min-Soo;Lee, In;Ahn, Seok-Min
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제13권1호
    • /
    • pp.58-63
    • /
    • 2012
  • In general, a conventional flap on an aircraft wing can reduce the aerodynamic efficiency due to geometric discontinuity. On the other hand, the aerodynamic performance can be improved by using a shape-morphing wing instead of a separate flap. In this research, a new flap morphing mechanism that can change the wing shape smoothly was devised to prevent aerodynamic losses. Moreover, a prototype wing was fabricated to demonstrate the morphing mechanism. A shape memory alloy (SMA) wire actuator was used for the morphing wing. The specific current range was measured to control the SMA actuator. The deflection angles at the trailing edge were also measured while various currents were applied to the SMA actuator. The trailing edge of the wing changed smoothly when the current was applied. Moreover, the deflection angle also increased as the current increased. The maximum frequency level was around 0.1 Hz. The aerodynamic performance of the deformed airfoil by the SMA wire was analyzed by using the commercial program GAMBIT and FLUENT. The results were compared with the results of an undeformed wing. It was demonstrated that the morphing mechanism changes the wing shape smoothly without the extension of the wing skin.

셀 분할을 이용한 거리장의 효율적 계산 (Efficient Calculation of Distance Fields Using Cell Subdivision)

  • 유동진
    • 한국정밀공학회지
    • /
    • 제25권3호
    • /
    • pp.147-156
    • /
    • 2008
  • A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

전역 및 국부 기하 특성을 반영한 메쉬 분할 (A Mesh Segmentation Reflecting Global and Local Geometric Characteristics)

  • 임정훈;박영진;성동욱;하종성;유관희
    • 정보처리학회논문지A
    • /
    • 제14A권7호
    • /
    • pp.435-442
    • /
    • 2007
  • 본 논문에서는 3D 메쉬 모델의 텍스쳐 매핑, 단순화, 모핑, 압축, 형상정합 등 다양한 분야에 응용될 수 있는 메쉬분할 문제를 다룬다. 메쉬 분할은 주어진 메쉬를 서로 떨어진 집합(disjoint sets)으로 나누는 과정으로서, 본 논문에서는 메쉬의 전역적 및 국부적 기하 특성을 동시에 반영하여 메쉬를 분할하는 방법을 제시하고자 한다. 먼저 주어진 메쉬의 국부적 기하 특성인 곡률 정보와 전역적 기하 특성인 볼록성을 이용하여 메쉬 정점들 중 첨예정점(sharp vertex)을 추출하고, 모든 첨예정점들 간의 유클리디언 거리에 기반한 $\kappa$-평균군집화 기법[26]을 적용하여 첨예 정점들을 분할한다. 분할된 첨예정점에 속하지 않는 나머지 정점들에 대해서는 유클리디언 거리상 가까운 군집으로 병합하여 최종적인 메쉬분할이 이루어진다. 또한 본 논문에서 제안한 메쉬분할 방법을 구현하여 여러 메쉬 모델에 대해 실험 결과를 보여준다.