• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.297-299
• /
• 2015

In this paper we have examined the linear stability of triangular equilibrium points in the photogravitational restricted three body problem when both primaries are triaxial rigid bodies, the bigger one an oblate spheroid and source of radiation. The orbits about the Lagrangian equilibrium points are important for scientific investigation. A number of space missions have been completed and some are being proposed by various space agencies. We analyze the periodic motion in the neighbourhood of the Lagrangian equilibrium points as a function of the value of the mass parameter. Periodic orbits of an infinitesimal mass in the vicinity of the equilibrium points are studied analytically and numerically. The linear stability of triangular equilibrium points in the photogravitational restricted three body problem with Poynting-Robertson drag when both primaries are oblate spheroids has been examined by A. Kumar (2007). We have found the equations of motion and triangular equilibrium points for our problem. With the help of the characteristic equation we have discussed stability conditions. Finally, triangular equilibrium points are stable in the linear sense. It is further seen that the triangular points have long or short periodic elliptical orbits in the same range of ${\mu}$.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.75-82
• /
• 1993

This paper deals with a systematic procedure for constructing a triangular composite surface which is interpolated from given scattered 3-D points. The procedure consists of a triangulation, construction of curve net, and interpolation of triangular patches. An obtained surface is composed of cubic triangular patches, which are $G^1$ continuous to adjacent other patches.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.824-828
• /
• 2000

Prior to the downloading of the NC codes to a machining center, the NC tool-path can be verified in a computer. The Z-map is one of the tools for the verification of NC tool-path. The Z-map is a two dimensional array in which the height values of the Z-axis direction vectors are stored. The Z-axis direction vectors are arranged in a rectangular grid pattern on the XY plane. The accuracy of the simulation comes from the grid interval. In the rectangular Z-map, the distances between the grid points are different. The distance in diagonal direction is larger than those in X or Y axis directions. For the rendering of the Z-map, a rectangular grid is divided into two triangular facets. Depending on the selection of a diagonal, there are two different cases. In this paper, triangular Z-map, in which the Z-axis direction vectors are arranged in a triangular grid pattern on XY plane, is proposed. In the triangular Z-map, the distances between grid points are equal. There is no ambiguity to make triangular facets for the rendering.

• 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.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.293-294
• /
• 2015

This work considers the elliptic restricted three-body problem under effects of radiation of the bigger primary, and an oblate spheroid for the smaller primary to mimic an exoplanetary system with a gas giant planet. Under the influences of both effects we look for the existence of the triangular equilibrium points and the influences of the radiation and oblateness on the locations and motion of the points. We set the system in a normalized rotating coordinate system and derive equations of motion for the third infinitesimal object. Our study shows that the effects modify the equilateral/isosceles triangle shape with respect to the primaries. The triangular points also have non-planar motion with period depending on the value of the planet oblateness.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.591-601
• /
• 2005

The results of fuzzy linear regression are very sensitive to irregular data. When this points exist in a set of data, a fuzzy linear regression model can be incorrectly interpreted. The purpose of this paper is to detect irregular data and to propose robust fuzzy linear regression based on M-estimators with triangular fuzzy regression coefficients for crisp input-output data. Numerical example shows that irregular data can be detected by using the residuals based on M-estimators, and the proposed robust fuzzy linear regression is very resistant to this points.

• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.133-140
• /
• 2009

Presented in this paper is a method to generate round-endmill toolpaths for sculptured surfaces represented as a triangular mesh model. The proposed method is applicable in toolpath generation for ball-endmills and flat-endmills because the round-endmill is a generalized tool in three-axis NC (numerical control) milling. The method uses a wireframe model as the offset model that represents a cutter location surface. Since wireframe models are relatively simple and fast to calculate, the proposed method can process large models and keep high precision. Intersection points with the wireframe offset model and a tool guide plane are calculated, and intersection curves are constructed by tracing the intersection points. The final step of the method is extracting regular curves from the intersection curves including degenerate and self-intersected segments. The proposed method is implemented and tested, and a practical example is presented.

• International Journal of CAD/CAM
• /
• v.4 no.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.