• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.9
• /
• pp.148-157
• /
• 2007

A new method which uses distance fields scheme and marching cube algorithm is proposed in order to get an accurate offset model of arbitrary shapes composed of triangular net. In the method, the space bounding the triangular net is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the suggested detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel distance fields are created by calculating the minimum distances between corner points of voxels and triangular net. After generating the whole distance fields, the offset surface were constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangular net.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.713-718
• /
• 1994

Voronoi diagrams for closed shapes have many practical applications, ranging from numerical control machining to mesh generation. Shape offset based on Voronoi diagram avoids the topological problems encountered in traditional offsetting algorithms. In this paper, we propose a procedure for generating a Voronoi diagram and an exact offset for planar curve. A planer curve can be defined by free-form curve segements. The procedure consists of three steps : 1) segmentation by minimum curvature, 2) construction of Voronoi diagram, and 2) generation of the exact offset.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.203-211
• /
• 2004

In this paper, we present a method of extracting a regular 2-manifold triangular net from a triangular net including degenerate and self-intersected triangles. This method can be applied to obtaining an offset model without degenerate and self-intersected triangles. Then this offset model can be used to generate CL curves and extract machining features for CAPP The robust and efficient algorithm to detect valid triangles by growing regions from an initial valid triangle is presented. The main advantage of the algorithm is that detection of valid triangles is performed only in valid regions and their adjacent selfintersections, and omitted in the rest regions (invalid regions). This advantage increases robustness of the algorithm. As well as a k-d tree bucketing method is used to detect self-intersections efficiently.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.405-409
• /
• 1997

Voronoi diagrams are applied in varios field such as NC toolpath generation, VLSI design and robot path planning because of their geometric charcteristics. In this paper, Voronoi diagrams are introduced on polygon constructed by line segments only and with constant offset. Bisector curves for two arbitrary objects, which is the combination of line segment and arc, are defined as parametric fuction where the parameter is used as offset. Offset curves are applied on the generation of laser scanning path for the stereolithography and shows a good result from several examples.