• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.2
• /
• pp.313-320
• /
• 2011

SPH(Smoothed Particle Hydrodynamics) is a gridless Lagrangian technique that is useful as an alternative numerical analysis method used to analyze high deformation problems as well as astrophysical and cosmological problems. In SPH, all points within the support of the kernel are taken as neighbours. The accuracy of the SHP is highly influenced by the method for choosing neighbours from all particle points considered. Typically a linked-list method or tree search method has been used as an effective tool because of its conceptual simplicity, but these methods have some liability in anisotropy situations. In this study, convex hull algorithm is presented as an improved method to eliminate this artifact. A convex hull is the smallest convex set that contains a certain set of points or a polygon. The selected candidate neighbours set are mapped into the new space by an inverse square mapping, and extract a convex hull. The neighbours are selected from the shell of the convex hull. These algorithms are proved by Fortran programs. The programs are expected to use as a searching algorithm in the future SPH program.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.111-123
• /
• 2009

We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.

• Asia-Pacific Journal of Business
• /
• v.9 no.2
• /
• pp.1-13
• /
• 2018

Physics simulation is an important part of many interactive 2D applications and collision detection and response is key component of this simulation. While methods for reducing the number of collision tests that need to be performed has been well researched, methods for performing the final checks with collision primitives have seen little recent development. This paper presents a new collision primitive, the n-arc, constructed from piecewise circular curves or biarcs. An algorithm for performing a collision check between these primitives is presented and compared to a convex polygon primitive. The n-arc is shown to exhibit similar, though slightly slower, performance to a polygon when no collision occurs, but is considerably faster when a collision does occur. The goodness of fit of the new primitive is also compared to a polygon. While the n-arc often gives a looser fit in terms of area, the continuous tangents of the n-arcs makes them a good choice for organic, soft or curved surfaces.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.2
• /
• pp.61-68
• /
• 1996

In this paper we propose a new visualization technique to characterize qualitative information of a large DNA sequence. While a long DNA sequence has huge information, it is not easy to obtain genetic information from the DNA sequence. We transform DNA sequences into a polygon to compute their homology in image domain rather than text domain. Our program visualizes DNA sequences with colored random walk plots and simplify them k-convex hulls. A random walk plot represents DNA sequence as a curve in a plane. A k-convex hull simplifies a random work plot by removing some parts of its insignificant information. This technique gives a biologist an insight to detect and classify DNA sequences with easy. Experiments with real genome data proves our approach gives a good visual forms for long DNA sequences for homology analysis.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.2
• /
• pp.195-202
• /
• 2002

An automated process planning system for cold forging of non-axisymmetric parts of comparatively simple shape was developed in this study. Programs for the system have been written with Visual LISP in the AutoCAD using a personal computer and are composed of four main modules such as input module, shape cognition and shape expression module, material diameter determination module and process planning module. The design rules and knowledges for the system are extracted from the plasticity theories, handbook, relevant reference and empirical knowledge of field experts. Generally, in forging, only front view is needed for expression of axisymmetric parts, but non-axisymmetric parts need front and plane view. At the plane, this system cognizes the external shape of non-axisymmetric, parts - number of sides of regular polygon and radius of a circle circumscribing the polygon of n sides. At the front view, the system perceives diameter of axisymmetric portions and height of primitive geometries such as polygon, cylinder, cone, concave, convex, etc.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.637-645
• /
• 2016

For a polygon P, we consider the centroid $G_0$ of the vertices of P, the centroid $G_1$ of the edges of P and the centroid $G_2$ of the interior of P, respectively. When P is a triangle, the centroid $G_0$ always coincides with the centroid $G_2$. For the centroid $G_1$ of a triangle, it was proved that the centroid $G_1$ of a triangle coincides with the centroid $G_2$ of the triangle if and only if the triangle is equilateral. In this paper, we study the relationships between the centroids $G_0$, $G_1$ and $G_2$ of a quadrangle P. As a result, we show that parallelograms are the only quadrangles which satisfy either $G_0=G_1$ or $G_0=G_2$. Furthermore, we establish a characterization theorem for convex quadrangles satisfying $G_1=G_2$, and give some examples (convex or concave) which are not parallelograms but satisfy $G_1=G_2$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1931-1940
• /
• 2014

In this paper, we propose a new hand shape recognition algorithm based on the geometric features using the convex-hull from the depth image acquired by Kinect system. Kinect is a camera providing a depth image and user's skeleton information and used for detecting hand region. In the proposed algorithm, hand region is detected in a depth image acquired by Kinect and convex-hull of the region is found. Boundary points caused by noise and unnecessary points for recognition are eliminated in the convex-hull that changes depending on hand shape. Hand shape is recognized by the sum of internal angle of a polygon that is matched with convex-hull reconstructed with selected boundary points. Through experiments, we confirm that proposed algorithm shows high recognition rate not only for five models but also those cases rotated.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2006.11a
• /
• pp.909-912
• /
• 2006

This paper examined the applicability of convex hull, which is defined as the minimal convex polygon including all points, to assessment model for effective region. In order to validate the applicability of the convex hull to assessment model for effective region, a genetic algorithm was adopted as a optimum technique, and an artificial neural network was adopted as a prediction model for material properties. The mix-proportion obtained from the proposed technique is more reasonable than that obtained from previous work.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.