• 한국정밀공학회지
• /
• 제21권6호
• /
• pp.160-166
• /
• 2004

In this study, a new algorithm, named as Contour Offset Algorithm(COA) is developed to fabricate precise features or patterns in the range of several micrometers by nano replication printing(nRP) process. In the nRP process, a femto-second laser is scanned on a photosensitive monomer resin in order to induce polymerization of the liquid monomer according to a voxel matrix which is transformed from the bitmap format file. After polymerization, a droplet of ethanol is dropped to remove the unnecessary remaining liquid resin and then only the polymerized figures with nano-scaled precision are remaining on the glass plate. To obtain more precise replicated features, the contour lines in voxel matrix should be modified considering a voxel size. In this study, the efficiency of the proposed method is shown through two examples in view of accuracy.

• 한국정밀공학회지
• /
• 제25권3호
• /
• pp.157-164
• /
• 2008

While developing physical prototype from CAD model, rapid prototyping mainly focuses on two key points reducing time and material consumption. So, we have to change from a traditional solid model to building a hollowed prototype. In this paper, a new method is presented to hollow out solid objects with uniform wall thickness to increase RP efficiency. To achieve uniform wall thickness, it is necessary to generate internal contour by slicing the offset model of an STL model. Due to many difficulties in this method, this paper proposes a new algorithm that computes internal contours computing offset model which is generated from external contour using wall thickness. Proposed method can easily compute the internal contour by slicing the offset surface defined by the sum of circle swept volumes of external contours without actual offset and the circle wept volumes. Internal contour existences are confirmed by using the external point. Presented algorithm uses the 2D geometric algorithm allowing RP implementation more efficient. Various examples have been tested with implementation of the algorithm, and some examples are presented for illustration.

• 대한기계학회논문집A
• /
• 제30권2호
• /
• pp.141-148
• /
• 2006

In this paper, a new offset algorithm for closed 2D lines with islands is introduced and the result is illustrated. The main point of the proposed algorithm is that every point is set to be an offset by using bisectors, and then invalid offset lines, which are not to be participated in offsets, are detected in advance and handled with an invalid offset edge handling algorithm. As a result, raw offset lines without local invalid loops are generated. The proposed offset method is proved to be robust and simple, moreover, has a near O(n) time complexity, where n denotes the number of input lines. In addition, the proposed algorithm has been implemented and tested with 2D lines of various shapes.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2012년도 춘계학술대회 논문집
• /
• pp.441-442
• /
• 2012

• 한국CDE학회논문집
• /
• 제11권5호
• /
• pp.375-383
• /
• 2006

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and circular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to a tool path. A modified pairwise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on avoiding thin-wall cutting and minimizing tool retractions. The proposed algorithm has been implemented in C++ and some illustrative examples are presented to show the practical strength of the algorithm.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2008년도 춘계학술대회 논문집
• /
• pp.333-334
• /
• 2008

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.200-207
• /
• 2003

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and cricular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to tool path. A modified pair-wise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on minimizing tool retractions and preventing thin-wall rotting The proposed algorithm has been implemented In C++ and some illustrative examples are presented to show the practical strength of the algorithm.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.169-173
• /
• 2001

Presented in this paper is a CPO tool-path linking procedure optimizing technological objectives, such as dealing with islands (positive and negative) and minimizing tool retractions, drilling holes and slotting. Main features of the proposed algorithm are as follows; 1) a data structure, called a 'TPE-net', is devised to provide information on the parent/child relationships among the tool-path-elements, 2) the number of tool retractions is minimized by a 'tool-path-element linking algorithm'fading a tour through the TPE-net, and 3) the number of drilling holes is minimized by making use of the concept of the 'free space'.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2002년도 Proceedings
• /
• pp.68-73
• /
• 2002

In standard teletherapy, a treatment plan is generated with the aid of a treatment planning system, but it is common to perform an independent monitor unit verification calculation (MUVC). In exact analogy, we propose and demonstrate that a simple and accurate MUVC in Intensity Modulated Radiotherapy (IMRT) is possible. We introduce a concept of Modified Clarkson Integration (MCI). In MCI, we exploit the rotational symmetry of scattering to simplify the dose calculation. For dose calculation along a central axis (CAX), we first replace the incident IMRT fluence by an azimuthally averaged fluence. Second, the Clarkson Integration is carried over annular sectors instead of over pie sectors. We wrote a computer code, implementing the MCI technique, in order to perform a MUVC for IMRT purposes. We applied the code to IMRT plans generated by CORVUS. The input to the code consists of CORVUS plan data (e.g., DMLC files, jaw settings, MU for each IMRT field, depth to isocenter for each IMRT field), and the output is dose contribution by individual IMRT field to the isocenter. The code uses measured beam data for Sc, Sp, TPR, (D/Mu)$\_$ref/ and includes effects from MLC transmission, and radiation field offset. On a 266 MHZ desktop computer, the code takes less than 15 sec to calculate a dose. The doses calculated with MCI algorithm agreed within +/- 3% with the doses calculated by CORVUS, which uses a 1cm x 1cm pencil beam in dose calculation. In the present version of MCI, skin contour variations and inhomogeneities were neglected.