• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.7
• /
• pp.119-124
• /
• 1999

A method to find the line of sight ray in space which corresponds to a point in an image plane is presented. The line of sight ray is defined by two points which are the intersections between the two calibration planes and the sight ray. The intersection point is found by the oblique coordinate mapping between the image plane and the calibration plane in the space. The proposed oblique coordinate mapping method has advantages over the transformation matrix method in the required memory space and computation time.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.457-478
• /
• 2015

In this paper we propose an iteration hybrid method for approximating a point in the intersection of the solution-sets of pseudomonotone equilibrium and variational inequality problems and the fixed points of a semigroup-nonexpensive mappings in Hilbert spaces. The method is a combination of projection, extragradient-Armijo algorithms and Manns method. We obtain a strong convergence for the sequences generated by the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.716-721
• /
• 1990

It is one of the essential task to determine the absolute location of mobile robot during its navigation. In this paper we propose an algorithm to calculate the distance and orientation of camera from landmark through the visual image of stripe typed landmark. Exact closed form solution of camera location is obtained with the correspondences from vertical line on mark plane to the intersection point of projected line with horizontal axis of image plane. It needs only one line image information, so that location determination can be processed in real time.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.7-14
• /
• 2008

One of purposes of installing signals at intersections is to protect traffic conflicts and accidents from occurring by means of arranging the right-of-way of travel more clearly. On the other hand, the installation of signals, and especially their location, can also have negative effects on safety. Therefore, the location of signals is of great importance. To secure a high safety level for urban signalized intersection, efforts are required to introduce a comprehensive recommendation or guideline for safety aspects of signal installation that takes local conditions into account. In this context, this reports on a study that analyzed the influence of signal location on the behavior of drivers who approach a signalized intersection in urban area. As a result, the study found out that the traffic signal location strongly affects the braking point of the Dilemma Zone(DZ), and the braking point of the DZ based on driving speed. Also, in terms of design layout, it has been illustrated that there is a close relation between signal location and road safety, especially DZ safety. Finally, this paper proposes a practical recommendation for signal installation related to how to locate the signal in practice for the sake of securing the safety level of signalized intersection.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.1
• /
• pp.26-33
• /
• 2017

In this study, the surface marker method, one of the particle tracking methods, used to track the free surface is extended to cover the more general cases easily including the collision and separation of the free surface. In surface particle method to redistribute particles effectively using the grid system, the free surface is composed of the sum of quadrilaterals having four curves where fixed markers are placed at ends of each curve. Fixed markers are used to know how curves are connected to each other. The position of fixed markers can move as the free surface deforms but all fixed markers cannot be deleted during all time of simulation to keep informations of curve connection. In the case of the collision or separtion of the free surface where several curves can be intersected disorderly, severe difficulties can occur to define newly states of curve connection. In this study, the adaptable surface parTicle method without fixed markers is introduced. Intersection markers instead of the fixed markers are used to define quadrilaterals. The position of the intersection markers is defined to be the intersection point between the free surface and the edge of the grid and it can be added or deleted during the time of simulation to allow more flexibilities. To verify numerical schemes, two flow cases are simulated and the numerical results are compared with other's one and shown to be valid.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.367-372
• /
• 2018

This paper proposed an algorithm that detects boundary nodes effectively in wireless sensor network. A boundary node is a sensor that lies on the border of network holes or the outer boundary of wireless sensor network. Proposed algorithm detects boundary nodes using only the position information of sensors. In addition, to improve detect performance, sensor computes the overlap area of nearest sensor first. Simulation is performed to validate the process of the proposed algorithm. In Simulation, several obstacles are placed and varying number of sensors in the range of 500~1500 are deployed in the area in order to reflect real world. The simulation results shows that proposed algorithm detects boundary nodes effectively that are located on the border of holes and the outer boundary of wireless sensor network.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.3
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

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

Developed in this research is a surface modeling kernel for various CAD/CAM applications. Its internal surface representations are rational parametric polynomials, which are generalizations of nonrational Bezier, Ferguson, Coons and NURBS surface, and are very fast in evaluation. The kernel is designed under the OOP concepts and coded in C++ on PCs. The present implementation of the kernel supports surface construction methods, such as point data interpolation, skinning, sweeping and blending. It also has NURBS conversion routines and offers the IGES and ZES format for geometric information exchange. It includes some geometric processing routines, such as surface/surface intersection, curve/surface intersection, curve projection and so forth. We are continuing to work with the kernel and eventually develop a B-Rep based solid modeler.