• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.3-10
• /
• 2007

A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.3 s.168
• /
• pp.107-114
• /
• 2005

A new approach which combines implicit surface scheme and point projection method is presented in order to fill the arbitrarily shaped holes in the polygon model. In the method a trimmed surface which has an outer boundary curve is generated by using the implicit surface scheme and normal projection of point onto the base surface. The base surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In this paper an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$. The base surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In order to show the validity of the present study, various hole fillings are carried out for the complex polygon model of arbitrary topology.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.9 s.186
• /
• pp.190-199
• /
• 2006

A new approach which combines implicit surface scheme and recursive subdivision method is suggested in order to fill the holes with complex shapes in the polygon model. In the method, a base surface is constructed by creating smooth implicit surface from the points selected in the neighborhood of holes. In order to assure C$^1$ continuity between the newly generated surface and the original polygon model, offset points of same number as the selected points are used as the augmented constraint conditions in the calculation of implicit surface. In this paper the well-known recursive subdivision method is used in order to generate the triangular net with good quality using the hole boundary curve and generated base implicit surface. An efficient anisotropic smoothing algorithm is introduced to eliminate the unwanted noise data and improve the quality of polygon model. The effectiveness and validity of the proposed method are demonstrated by performing numerical experiments for the various types of holes and polygon model.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.1 s.178
• /
• pp.174-184
• /
• 2006

In order to fill the holes with complex shapes in the large polygon model, a new approach which is based on the implicit surface interpolation method combined with domain decomposition method is presented. In the present study, a surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In the method an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$ The generated surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In this paper the well-known domain decomposition method is used in order to treat the large polygon model. The global domain of interest is divided into smaller domains where the problem can be solved locally. LU decomposition method is used to solve a set of small local problems and their local solutions are combined together using the weighting coefficients to obtain a global solution. In order to show the validity of the present study, various hole fillings are carried out fur the large and complex polygon model of arbitrary topology.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.11-13
• /
• 2010

Combined with the indeterminate boundaries of spatial objects, n:m correspondences makes an object-based matching be a complex problem. In this study, we model the boundary of a polygon object with fuzzy model and describe their overlapping relations as a weighted bipartite graph. Then corresponding pairs including 1:0, 1:1, 1:n and n:m relations are identified using a spectral singular value decomposition.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.1
• /
• pp.68-74
• /
• 2000

The STL file format is an approximation of 3-D model with triangular facets. STL is a standard input file format of Rapid Prototyping(RP) equipment In computer graphics a circle has been approximated with an inscribed polygon which causes an error between the real and approximated circles. In this study an intersecting polygon has been used to approximate the circle and applied to produce more accurate RP part. The newly proposed method shows it's excellence in part accuracy.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.11a
• /
• pp.515-520
• /
• 2008

This paper develops a mite element model of a polygon mirror scanner motor supported by the sintered bearing and flexible supporting structures to analyze the shock response by using the finite element method and the mode superposition method. The validity of the proposed model is verified by comparing the simulated natural frequencies and shock response with the experimental ones. It investigates the displacement and the stress of the most vulnerable component, i.e. a leaf spring due to shock, and it proposes a robust design of leaf spring of a polygon mirror scanner motor against shock.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.33-39
• /
• 2000

Well known is the directed self-avoiding walk model on the square lattice with reflecting and absorbing barriers. We consider two models, namely, a pyramid self-avoiding polygon model and a top and bottom pyramid polygon model, as subcollections of the model. We derive explicit formulas for the number of 2N-step polygons in these models.

• Journal of Korea Game Society
• /
• v.1 no.1
• /
• pp.55-60
• /
• 2001

With rapid development of graphic hardware, researches on Virtual Reality and 3D Games have received more attention than before. For more realistic 3D graphic scene, objects were to be presented with lots of polygons and the number of objects shown in a scene was remarkably increased. Therefore, for effective visualization of large polygon models like this, view-frustum culling method, that visualizes only objects shown in the screen, has been widely used. In general, the bounding boxes that include objects are generated firstly, and the boxes are intersected with view-frustum to check whether object is in the visible area or not. Recently, an algorithm that can check in-out test of objects using OpenGL's selection mode, which is originally used to select the objects in the screen, is suggested. This algorithm is fast because it can use hardware acceleration. In this study, by implementing and applying this algorithm to large polygon models, we showed the efficiency of OpenGL assisted View-Frustum Culling algorithm. If this algorithm is applied to 3D games that have to process more complicated characters and landscapes, performance improvement can be expected.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.05a
• /
• pp.81-86
• /
• 1999

The STL file format is an approximation of 3-D model with triangular facets. STL is a standard input file format of Rapid Prototyping(RP) equipment. In computer graphics, a circle has been approximated with an inscribed polygon, which causes an error between the real and approximated circles. In this study, an intersecting polygon has been used to approximate the circle and applied to produce more accurate RP part. The newly proposed method shows it's excellence in part accuracy.