• 제목/요약/키워드: subdivision method

검색결과 175건 처리시간 0.023초

3D 프린팅을 이용한 3차원 채움 패턴의 중량과 출력시간을 고려한 인장강도 연구 (A Study on Tensile Strength Considering Weight and Printing Time of 3D Infill Patterns using 3D Printing)

  • 나두현;김호준;김현준
    • 소성∙가공
    • /
    • 제32권5호
    • /
    • pp.255-267
    • /
    • 2023
  • Recently, 3D printing using a material extrusion method is used in various fields. Since plastic material has lower strength than steel, research to increase the strength is continuously being conducted. This study investigates the lattice structure for additive manufacturing of six 3D infill patterns (octet, quarter cubic, cubic, cubic subdivision, triangles and cross 3D) which consist of tetragons, hexagonal trusses, equilateral triangles and cross shapes. Consequently, in the tensile strength considering the weight and printing time, octet, quarter cubic, cubic and triangles patterns tended to increase linearly as the infill density increased, except for the infill density of 20%. However, the tensile strength/weight performed better than the infill density of 100% when the cubic subdivision pattern had the infill density of 20% and the cross 3D pattern had the infill density of 40%. Considering the weight and printing time, the infill patterns of high tensile strength were octet, quarter cubic, cubic, cubic subdivision, triangles and cross 3D order.

이동 범위 예측을 통한 온라인 서버 성능 향상 기법 (Server Performance Improvement with Predicted Range of Agent Movement)

  • 김용오;신승호;강신진
    • 한국게임학회 논문지
    • /
    • 제11권1호
    • /
    • pp.101-109
    • /
    • 2011
  • 온라인 게임 시장의 규모가 커짐에 따라 온라인 게임의 서버 성능에 대한 중요성이 커지고 있다. 본 논문은 게임 속의 객체 상태에 대한 동기화 패킷을 줄여 서버의 성능을 높이는 방안을 제안한다. 제안하는 방식은 게임 속의 각 객체의 이동 범위에 대한 예측과 못가는 지역에 대한 처리를 통하여 지형간의 경계이동 횟수가 감소될 수 있도록 지형을 재구성 할 수 있는 해결책을 제공한다. 성능평가는 제안하는 지형분할방식이 기존방법에 비해 동기화 패킷에 대한 처리량이 줄어드는 것을 보여준다.

초고층 복합주거단지의 친환경 계획요소 평가를 통한 개선방안에 관한 연구 (A Study on Improvement Method by Environmental-Friendly Planning Elements of High-rise Residential Complex)

  • 황중만;이주형
    • 한국산학기술학회논문지
    • /
    • 제15권3호
    • /
    • pp.1522-1530
    • /
    • 2014
  • 초고층 복합주거 유형은 도심지에서 신도시 개발 및 도시재생에 있어 중요한 위치로 주목받고 있다. 하지만 초고층 주상복합의 경우 친환경계획요소에 대한 정리와 실제 거주자들을 대상으로 한 만족도에 관한 연구는 미비한 실정이다. 이에 본 연구는 초고층 친환경계획요소를 단지, 건물내부, 설비 및 유지관리로 구분하여 전문가를 대상으로 중요도 거주자를 만족도를 평가하였다. 이를 바탕으로 본 연구에서는 보다 다양한 관점에서 평가할 수 있는 M-IPA를 이용하여 초고층 복합주거 친환경 계획요소의 개선방안 및 시사점을 도출하고자 한다. 그 결과 첫째, 단지 부문은 복합적 토지이용, 친환경 교통은 유지관리를 지속해야 할 것으로 나타났다. 둘째, 건물내부 부문은 생태적 단지환경, 실내공기환경이 개선이 시급한 것으로 나타났고, 실내온열환경은 유지관리를 지속해야 하는 것으로 판단되었다. 마지막으로 설비/유지관리는 재료 및 설비와 에너지 관리 지표가 개선이 시급한 것으로 나타났다.

A STUDY OF SUBDIVISION METHOD TO THREE AND FIVE SIDED FACES BASED ON REGULAR POLYGON

  • Muraki, Yuta;Konno, Kouichi;Tokuyama, Yoshimasa
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2009년도 IWAIT
    • /
    • pp.551-556
    • /
    • 2009
  • 3-D CAD (Computer Aided Design) system is an indispensable tool for manufacturing. A lot of engineers have studied for the methods to generate a curved surface on an N-sided shape, which is the basic technology of 3-D CAD systems. This surface generation, however, has three problems on the case of long and narrow shapes: the resultant surface is distorted, the surface is not continuous to adjacent surfaces, or additional user inputs are required to generate the surface. Conventional methods have not yet solved these problems at the same time. In this paper, we propose the method to generate internal curves that divide a long and narrow shape into regular N-sided sections so as to divide the shape into an N-sided section and four-sided ones. Our method controls the shape of internal curves by dividing an N-sided long and narrow shape into an N-sided section and four-sided ones, and solves distortion of the generated curved surface. In addition, each of the generated sections is interpolated with G1-continuous surfaces. This process does not require any user's further input. Therefore, the three problems mentioned above will be solved at the same time.

  • PDF

A Shape-preserved Method to Improve the Developability of Mesh

  • Su, Zhixun;Liu, Xiuping;Zhou, Xiaojie;Shen, Aihong
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.219-224
    • /
    • 2005
  • Developable surface plays an important role in computer aided design and manufacturing systems. This paper is concerned with improving the develop ability of mesh. Since subdivision is an efficient way to design complicated surface, we intend to improve the developability of the mesh obtained from Loop subdivision. The problem is formulated as a constrained optimization problem. The optimization is performed on the coordinates of the points of the mesh, together with the constraints of minimizing shape difference and maximizing developability, a developability improved mesh is obtained.

  • PDF

SOLAS 손상복원성 규정(Harmonized SDS) 변경에 따른 설계 영향 검토 (A Research of the New Harmonized Requirements of SOLAS for Subdivision and Damage Stability)

  • 이선택;권오익;염천환
    • 대한조선학회 특별논문집
    • /
    • 대한조선학회 2006년도 특별논문집
    • /
    • pp.81-88
    • /
    • 2006
  • Recently, the Session of MSC $80^{th}$ has adopted the new harmonized requirements of damage stability for Passenger, Ro-Ro Passenger ship and Ory Cargo ship based on the probabilistic analyzing method reflecting the study of IMO for more than ten years. This paper introduces what have been changed in the SOLAS requirements about SDS (Subdivision and Damage Stability) and the results of investigation for design effects according to the new rules.

  • PDF

조직화되지 않은 점군으로부터의 3차원 완전 형상 복원 (Complete 3D Surface Reconstruction from Unstructured Point Cloud)

  • 이일섭;김석일
    • 대한기계학회논문집A
    • /
    • 제29권4호
    • /
    • pp.570-577
    • /
    • 2005
  • In this study a complete 3D surface reconstruction method is proposed based on the concept that the vertices of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

3차원 8분할 Delaunay 삼각화 알고리즘 개발 (Development of Delaunay Triangulation Algorithm Using Oct-subdivision in Three Dimensions)

  • 박시형;이성수
    • 한국CDE학회논문집
    • /
    • 제10권3호
    • /
    • pp.168-178
    • /
    • 2005
  • The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

Large-scale TSP의 근사해법에 관한 연구 (A domain-partition algorithm for the large-scale TSP)

  • 김현승;유형선
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.601-605
    • /
    • 1991
  • In this paper an approximate solution method for the large-scale Traveling Salesman Problem(TSP) is presented. The method start with the subdivision of the problem domain into a number of clusters by considering their geometries. The clusters have limited number of nodes so as to get local solutions. They are linked to give the least path which covers the whole domain and become TSPs with start- and end-node. The approximate local solutions in each cluster are obtained by using geometrical property of the cluster, and combined to give an overall-approximate solution for the large-scale TSP.

  • PDF