• 제목/요약/키워드: Layer-Slicing Algorithm

검색결과 6건 처리시간 0.024초

An Adaptive Slicing Algorithm for Profiled Edge laminae Tooling

  • Yoo, Seung-Ryeol;Walczyk, Daniel
    • International Journal of Precision Engineering and Manufacturing
    • /
    • 제8권3호
    • /
    • pp.64-70
    • /
    • 2007
  • Of all the rapid tooling (RT) methods currently available, thick-layer laminated tooling is the most suitable for large-scale, low-cost dies and molds. Currently, the determination of a lamina's contour or profile and the associated slicing algorithms are based on existing rapid prototyping (RP) data manipulation technology. This paper presents a new adaptive slicing algorithm developed exclusively for profiled edge laminae (PEL) tooling PEL tooling is a thick-layer RT technique that involves the assembly of an array of laminae, whose top edges are simultaneously profiled and beveled using a line-of-sight cutting method based on a CAD model of the intended tool surface. The cutting profiles are based on the intersection curve obtained directly from the CAD model to ensure geometrical accuracy. The slicing algorithm determines the lamina thicknesses that minimize the dimensional error using a new tool shape error index. At the same time, the algorithm considers the available lamination thicknesses and desired lamina interface locations. We demonstrate the new slicing algorithm by developing a simple industrial PEL tool based on a CAD part shape.

Direct Slicing with Optimum Number of Contour Points

  • Gupta Tanay;Chandila Parveen Kumar;Tripathi Vyomkesh;Choudhury Asimava Roy
    • International Journal of CAD/CAM
    • /
    • 제4권1호
    • /
    • pp.33-45
    • /
    • 2004
  • In this work, a rational procedure has been formulated for the selection of points approximating slice contours cut in LOM (Laminated Object manufacturing) with first order approximation. It is suggested that the number of points representing a slice contour can be 'minimised' or 'optmised' by equating the horizontal chordal deviation (HCD) to the user-defined surface form tolerance. It has been shown that such optimization leads to substantial reduction in slice height calculations and NC codes file size for cutting out the slices. Due to optimization, the number of contour points varies from layer to layer, so that points on successive layer contours have to be matched by four sided ruled surface patches and triangular patches. The technological problems associated with the cutting out of triangular patches have been addressed. A robust algorithm has been developed for the determination of slice height for optimum and arbitrary numbers of contour points with different strategies for error calculations. It has been shown that optimisation may even lead to detection and appropriate representation of elusive surface features. An index of optimisation has been defined and calculations of the same have been tabulated.

3D layer 생성을 위한 RP 모델 분할 알고리즘 (RP model decomposition algorithm for making 3D layer)

  • 이재호;박준영
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.724-727
    • /
    • 2000
  • Rapid Prototyping(RP)이란 3차원 솔리드 모델을 단면화한 뒤 하나씩 적층하는 가공방식을 총칭한다. 이때 단면화하는 방법에 따라서 uniform, adaptive slicing으로 나뉘며, 입력 모델에 따라서 direct slicing과 STL을 이용한 방식으로 나뉜다. 적층 방법에 따라서는 연속된 2D 윤곽을 기반으로 적층하는 vertical layer 방식과 인접한 두 개의 2D 윤곽들을 연결하며 만들어진 3D layer를 기반으로 가공하는 sloping layer방식으로 나뉠 수 있다. 현재 상용 RP 시스템들에서는 거의 모든 경우 vertical layer 방식이 채택되어 사용되고 있다. RP와 절삭 공정, 예를 들면 CNC 밀링의 장점을 효율적으로 결합하기 위해서는 임의의 복잡한 형상을 갖는 솔리드 모델을 정밀도에 제한이 없이 제조할 수 있어야 한다. 그러나 절삭 공정은 특별한 전문적 지식들을 필요로 한다 또한 상용 RP에서 사용하는 순차적인 적층 작업으로는 가공할 수 없는 형상들이 많다. 대표적인 것으로 지지대를 필요로 하는 형상들이 있다. 이러한 형상들을 지원하기 위해서는 복잡한 3D 형상을 절삭 가능한 형식으로 분할하는 것과 적층 가능한 순서대로 공정 계획하는 것이 필요하게 된다. 본 연구에서는 SDM에서 제시된 3D 분할 방법이 솔리드 모델을 기반으로 전개되어 STL file과 같은 삼각다면체 형식으로 근사화된 모델에 적용하기 어렵다는데 착안하여 STL file에서 읽어들인 삼각 다면체 모델을 가공 가능한 3D 형상으로 분할하는 알고리즘을 제시하고자 한다.

  • PDF

3차원 Hybrid IC 배치를 위한 기둥첩 블록의 층할당 (Layer Assignment of Functional Chip Blocks for 3-D Hybrid IC Planning)

  • 이평한;경종민
    • 대한전자공학회논문지
    • /
    • 제24권6호
    • /
    • pp.1068-1073
    • /
    • 1987
  • Traditional circuit partitioning algorithm using the cluster development method, which is suitable for such applications as single chip floor planning or multiple layer PCB system placement, where the clusters are formed so that inter-cluster nets are localized within the I/O connector pins, may not be appropriate for the functiona block placement in truly 3-D electronic modules. 3-D hybrid IC is one such example where the inter-layer routing as well as the intra-layer routing can be maximally incorporated to reduce the overall circuit size, cooling requirements and to improve the speed performance. In this paper, we propose a new algorithm called MBE(Minimum Box Embedding) for the layer assignment of each functional block in 3-D hybrid IC design. The sequence of MBE is as follows` i) force-directed relaxation in 3-D space, ii) exhaustive search for the optimal orientation of the slicing plane and iii) layer assignment. The algorithm is first explaines for a 2-D reduced problem, and then extended for 3-D applications. An example result for a circuit consisting of 80 blocks has been shown.

  • PDF

FDM 3D 프린팅의 경로생성을 위한 옵?루프의 꼬임제거 알고리즘 (An Algorithm for the Removing of Offset Loop Twists during the Tool Path Generation of FDM 3D Printer)

  • 올리올 이슬람;김호찬
    • 한국기계가공학회지
    • /
    • 제16권3호
    • /
    • pp.1-8
    • /
    • 2017
  • Tool path generation is a part of process planning in 3D printing. This is done before actual printing by a computer rather than an AM machine. The mesh geometry of the 3D model is sliced layer-by-layer along the Z-axis and tool paths are generated from the sliced layers. Each 2-dimensional layer can have two types of printing paths: (i) shell and (ii) infill. Shell paths are made of offset loops. During shell generation, twists can be produced in offset loops which will cause twisted tool paths. As a twisted tool path cannot be printed, it is necessary to remove these twists during process planning. In this research, An algorithm is presented to remove twists from the offset loops. To do so the path segments are traversed to identify twisted points. Outer offset loops are represented in the counter-clockwise segment order and clockwise rotation for the inner offset loop to decide which twisted loop should be removed. After testing practical 3D models, the proposed algorithm is verified to use in tool path generation for 3D printing.

내구시험의 무인 주행화를 위한 비포장 주행 환경 자동 인식에 관한 연구 (The study for image recognition of unpaved road direction for endurance test vehicles using artificial neural network)

  • 이상호;이정환;구상화
    • 시스템엔지니어링학술지
    • /
    • 제1권2호
    • /
    • pp.26-33
    • /
    • 2005
  • In this paper, an algorithm is presented to recognize road based on unpaved test courses image. The road images obtained by a video camera undergoes a pre-processing that includes filtering, gray level slicing, masking and identification of unpaved test courses. After this pre-processing, a part of image is grouped into 27 sub-windows and fed into a three-layer feed-forward neural network. The neural network is trained to indicate the road direction. The proposed algorithm has been tested with the images different from the training images, and demonstrated its efficacy for recognizing unpaved road. Based on the test results, it can be said that the algorithm successfully combines the traditional image processing and the neural network principles towards a simpler and more efficient driver warning or assistance system.

  • PDF