• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which 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 the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.167-168
• /
• 2006

This paper proposes a new fault distance calculation method in the power quality (PQ) monitoring system. The proposed method calculates the fault impedance and the fault distance based on the measurement data of the PQ monitors and the information of the topology of the distribution systems. By using the iterative calculation method, the proposed method can find more exact location of the PQ events than the existing methods. The proposed method is applied to the IEEE 34 bus test feeders by using the PSCAD/EMTDC$^{TM}$.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.1
• /
• pp.64-69
• /
• 2013

For power system protection, the distance relay settings are important. Apparent factor is a necessary parameter in distance relay settings. Apparent factors have to be calculated when setting the distance relays and doing the resetting in case of configuration change in power system. The problem is that the current method to calculate apparent factor requires tools and plenty of time to do fault analysis and this method is complex especially in case of configuration change. Therefore this paper proposes a fast algorithm to calculate apparent factor without the fault analysis. Test results prove that this algorithm is simple and accurate by simulation.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.147-157
• /
• 2018

Alzheimer's disease has the significant factors for the both specific and characteristic features according to the disease progressing that are the volumetry and surface area by the brain hippocampus shrinking and thinning. However, we have suggested a shape analysis to calculate the variance by the roughness, coarseness or uneven surface on 3D MR images. For the reasons we have presented two methods: the first method is the distance calculation from major axis to edge points and the second method is the distance calculation from centroidal point to edge points on a coronal plane. Then we selected the shortest distance and the longest distance in each slice and analyzed the ANOVA and average distances. Consequently we obtained the available and great results by the longest distance of the axial and centroidal point. The results of average distances were 44.85(AD), 45.04(MCI) and 49.31(NC) from the axial points and 39.30(AD), 39.58(MCI) and 44.78(NC) from centroidal points respectively. Finally the distance variations for the easily recognized visualization were shown by the color mapping. This research could be provided an indicator of biomarkers that make diagnosis and prognosis the Alzheimer's diseases in the future.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.383-386
• /
• 2001

Distance relay is tripped by the line impedance calculated at the relay point. Accordingly the accurate operation depends on the precise calculation of line impedance. Impedance can be accurately calculated in case of overhead line. However, in case of power cables or combined transmission lines, impedance can not be accurately calculated because cable systems have the sheath, grounding wires, and cable cover protection units (CCPUs). There are also several grounding systems in cable systems. Therefore, if there is a fault in cable system, these terms will severely be caused much error to calculation of impedance. Accordingly the proper compensation should be developed for the correct operation of the distance relay. This paper presents the distance calculating algorithm in combined transmission line with power cable using wavelet transform. In order to achieve such purpose, judgement method to discriminate the fault section in both sections was proposed using db1 coefficient summation. And also, error compensation factor was proposed for correct calculation of impedance in power cable.

• Journal of the Optical Society of Korea
• /
• v.18 no.2
• /
• pp.134-145
• /
• 2014

The number of lens groups in modern zoom camera systems is increased above that of conventional systems in order to improve the speed of the auto focus with the high quality image. As a result, it is difficult to calculate zoom loci using the conventional analytic method, and even the recent one-step advanced numerical calculation method is not optimal because of the time-consuming problem generated by the iteration method. In this paper, in order to solve this problem, we suggest a new unified analytic method for zoom lens loci with finite object distance including infinite object distance. This method is induced by systematically analyzing various distances between the object and other groups including the first lens group, for various situations corresponding to zooming equations of the finite lens systems after using a spline interpolation for each lens group. And we confirm the justification of the new method by using various zoom lens examples. By using this method, we can easily and quickly obtain the zoom lens loci not only without any calculation process of iteration but also without any limit on the group number and the object distance in every zoom lens system.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.17 no.4
• /
• pp.213-220
• /
• 2005

An approach to calculate expected sliding distance of wave dissipating caisson breakwater is proposed. Time history of dynamic wave pressure for the calculation of sliding distance is made by extending conventional static wave pressure developed for the wave dissipating caisson breakwater. Construction of impact wave and standing wave was done by using duration time and maximum wave pressures of themselves. In the numerical analysis, the sliding distance for an attack of single wave and expected sliding distance for 50 years of wave dissipating breakwater by proposed method were compared with those by conventional method for uplift caisson breakwater. It was found that the sliding distance of wave dissipating breakwater by the proposed method is smaller than by conventional method.

• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.69-74
• /
• 2012

Hypersonic flowfields over a sphere is calculated by using a nonequilibrium flow solver. The flow solver features a two-temperature model and finite rate chemical reaction models to describe nonequilibrium thermochemical processes. For the purpose of validation, the calculated shock stand-off distance is compared with the experimental data which is measured in a ballistic range facility. The present nonequilibrium calculation well reproduced the experimental shock stand-off distance in the cases where the experimental flowfields are expected to be nearly equilibrium, as well as in the cases to be nonequilibrium flowfields in the velocity range 4000 to 5500 m/s.

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