• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.50-57
• /
• 2009

This paper proposes a extraction of feature lines on a polygonal model using local implicit surface fitting technique. To extract feature lines on a polygonal model, the previous technique addressed to compute the curvature and their derivatives at mesh vertices via global implicit surface fitting. It needs a user-specified precision parameter for finding an accurate projection of the mesh vertices onto an approximating implicit surface and requires high-time consumption. But we use a local implicit surface fitting technique to estimate the local differential information near a vertex by means of an approximating surface. Feature vertices are easily detected as zero-crossings, and can then be connected along the direction of principal curvature. Our method, demonstrated on several large polygonal models, produces a good fit which leads to improved visualization.

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.1-7
• /
• 2002

This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

• The Research Journal of the Costume Culture
• /
• v.10 no.6
• /
• pp.709-717
• /
• 2002

In the apparel industry, the technology has been advanced rapidly. The use of 3D scanning systems fur the capture and measurement of human body is becoming common place. Three dimensional digital image can be used for design, inspection, reproduction of physical objects. The purpose of this study is to develop a method that drafts men's basic bodice pattern from scanned 3D body surface shape data. In order to pursue this purpose the researchers developed pattern drafting algorithm. The 3D scanner used in this study was Cyberware Whole Body Scanner WB-4. The bodice pattern drafting algorithm from 3D body surface shape data developed in this study is as follows. First, convert geometric 3D body surface data to 3D polygonal mesh data. Second, develop algorithm to lay out 3D polygonal patches onto a plane using Auto Lisp program. The polygon meshes are coplanar, and the individual mesh is continuously in contact with next one The bodice front surface shape data in polygonal patches form was lined up in bust and waist levels. The back bodice was drafted by lining up the polygonal mesh in scapula, chest, and waist levels. in the drafts, gaps between polygons were formed into the darts.

• Laser Solutions
• /
• v.1 no.1
• /
• pp.24-29
• /
• 1998

A new wide laser beam optical system for the laser materials processing has been developed with a polygonal mirror. It consists of polygonal mirror and cooling part that prevents the surface of rotating polygonal mirror from damage by heat. The polygonal minors have been designed and made as 24 and 30 facets in pyramid type. This system provides a uniform linear laser heat source with the surface scanning width from 15 to 50mm according to the scanning height To examine the wide laser beam, He-Ne laser is used. Also, Acryl is used to confirm the laser beam pattern by bum-pattern print To analyze the energy distribution of the wide laser ben empirical values and theoretical values are compared and discussed. To improve the efficiency of the wide laser beam optical system, methods are suggested by the optical theories. For larger area processing like turbine blade, drawing blade, cold roller and guide plate, optimal overlapping locations have been calculated and analyzed by geometric and optical theories.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.71-77
• /
• 2010

Various applications, such as mesh composition and model repair, ask for a natural stitching for polygonal surfaces. Unlike the existing algorithms, we make full use of the information from the two feature lines to be stitched up, and present an accurate stitching method for polygonal surfaces, which minimizes the error between the feature lines. Given two directional polylines as the feature lines on polygonal surfaces, we modify the general placement method for points matching and arrive at a closed-form solution for optimal rotation and translation between the polylines. Following calculating out the stitching line, a local surface optimization method is designed and employed for postprocess in order to gain a natural blending of the stitching region.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.4
• /
• pp.529-540
• /
• 1995

The paper deals with a procedure for constructing a composite surface interpolating a polygonal curve mesh defined from 3D scattered points. The procedure consists of a poly-angulation, construction of a curve net, and interpolation of the curve net. The poly-angulation contains a stage that changes a triangular edge net obtained from a triangulation into a poly-angular edge net. A curve net is constructed by replacing edges on the edge net with cubic Bezier curves. Finally, inside of an n-sided polygon is interpolated by n subdivided triangular subpatches. The method interpolates given point data with relatively few triangular subpatches. For an n-sided polygon, our method constructs an interpolant with n subdivided triangular subpatches while the existing triangular surface modeling needs 3(n-2) subpatches. The obtained surface is composed of quartic triangular patches which are $G^1$-continuous to adjacent patches.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.713-721
• /
• 2008

This paper presents the robust velocity estimation of an omnidirectional mobile robot using a polygonal array of optical mice that are installed at the bottom of the mobile robot. First, the velocity kinematics from a mobile robot to an array of optical mice is derived as an overdetermined linear system. The least squares velocity estimate of a mobile robot is then obtained, which becomes the same as the simple average for a regular polygonal arrangement of optical mice. Next, several practical issues that need be addressed for the use of the least squares mobile robot velocity estimation using optical mice are investigated, which include measurement noises, partial malfunctions, and imperfect installation. Finally, experimental results with different number of optical mice and under different floor surface conditions are given to demonstrate the validity and performance of the proposed least squares mobile robot velocity estimation method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.787-792
• /
• 1996

The method of manipulation by striking a part and letting it slide until it comes to rest, has been very little studied. However, the manipulation method is not uncommon in our daily lives. We analyze the dynamic behavior of a rigid polygonal part being striked and sliding on a horizontal surface under the action of fiction. There are two parts in this problem; one is the impact problem, and the other is the sliding problem. We characterize the impact and sliding dynamics with friction for polygonal parts, and present the possibility of reverse calculation for motion planning of striking operations. Using a high speed video camera, the computer simulation results are experimentally verified.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.641-655
• /
• 2007

Parameterization has been one of very important research subjects in several application areas including computer graphics. In the parameterization research, the problem of mapping 3D polygonal model to 2D plane has been studied frequently, but the previous methods often fail to handle complicated shapes of polygonal surfaces effectively as well as entail distortion between the 3D and 2D spaces. Several attempts have been made especially to reduce such distortion, but they often suffer from the problem when an arbitrary rectangular surface region on 3D model is locally parameterized. In this paper, we propose a new local parameterization scheme based on the projection level set method. This technique generates a series of equi-distanced curves on the surface region of interest, which are then used to generate effective local parameterization information. In this paper, we explain the new technique in detail and show its effectiveness by demonstrating experimental results.