• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.382-386
• /
• 2004

This paper presents an algorithm for the triangular mesh intersection problem. The key aspect of the proposed algorithm is to reduce the number of triangle pairs to be checked for intersection. To this end, it employs two different approaches, the Y-group approach and the space partitioning approach. Even though both approaches have the same objective of reducing the number of triangular-triangular intersection (TTI) pairs, their inherent characteristics are quite different. While the V-group approach works by topology (reduces TTI pairs by guaranteeing no intersection among adjacent triangles), the space partitioning approach works by geometry (reduces TTI pairs by guaranteeing no intersection among distant triangles). The complementary nature of the two approaches brings substantial improvement in reducing the number TTI pairs.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.404-410
• /
• 2016

Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.4
• /
• pp.122-131
• /
• 2017

This study was a drone-utilized case study motivated by that drones can obtain sophisticated video image data previously not feasible. The dilemma zones on selected intersection approaches were identified and locations of drivers' decision making to stop or go at the onset of yellow were determined by analyzing drone video images. The gap between the drivers' decision making location and invisible stop/go border line provided by the yellow time interval was defined as "risky passing zone". To improve the dilemma zone safety problems, re-optimization of yellow time intervals and introduction of new pavement marking that can help drivers decision making on yellow indication are suggested.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.3
• /
• pp.187-195
• /
• 2017

The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.761-765
• /
• 2010

This paper presents the design of optimal fuzzy classifier for human detection by using genetic algorithms, one of the best-known meta-heuristic search methods. For this purpose, encoding scheme to search the optimal sequential intersection points between adjacent fuzzy membership functions is originally presented for the fuzzy classifier design for HOG (Histograms of Oriented Gradient) descriptors. The intersection points are sequentially encoded in the proposed encoding scheme to reduce the redundancy of search space occurred in the combinational problem. Furthermore, the fitness function is modified with the true-positive and true-negative of the confusion matrix instead of the total success rate. Experimental results show that the two proposed approaches give superior performance in HOG datasets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1270-1281
• /
• 1989

This paper presents two new storage schemes of 3-D objects to accelerate the finding of the first intersecting object and the shadow computation steps in ray tracing. The 3-D objects which are potentially intersected with the first reflection (refraction)ray are enrolled within a so called reflection (refraction) frustum' for a polygon object. Only those objects registered in the corres ponding frustum are immediately checked for intersection with the secondary rays emanating from the same polygon. The other is called a shadow pyramid' which contains the candidate objects possibly blocking the path from the relevant light source to any point on the relevant polgon. The shadow testing of a point is performed only against the objects contained in the associated shadow pyramid. Despite the cost needed for registration of objects within frusta or shadow pyramids, the total rendering time of ray tracing using the proposed approaches was reduced by approximately 50% (10% in color rendering time and 70% in shadoe testing time) from the conventional cell 50% (10% in color rendering time and 70% in shadow testing time) from the conventional cell traversal scheme under the 3-D uniform subdivision environment due to the fast finding of candidate objects for intersection and the reduced number of intersection calculations.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• International Journal of Highway Engineering
• /
• v.15 no.5
• /
• pp.123-133
• /
• 2013

PURPOSES : The present paper is to compare vehicles' $CO_2$ emissions in roundabouts and signalized intersections. METHODS : The present paper uses the SIDRA software with variables of traffic and road conditions. RESULTS : The results of the study are as follows : First, when entering traffic volumes are more than 1600pcph, vehicle's $CO_2$ emissions in roundabouts are lower than those of signalized intersections regardless of the left turn ratio. Second, When entering traffic volumes are more than 2800pcph, vehicles's $CO_2$ emissions in 2-lane approaches are lower than those of 1-lane approaches in signalized intersection. Third, when entering traffic volumes are more than 1600pcph, vehicle's $CO_2$ emissions of CASE B are lowest. (CASE B is the condition with one exclusive left-turn lane and one exclusive straight lane and one shared straight lane with right-turn.) Also, CASE A is the condition that vehicle's $CO_2$ emissions in roundabouts are lower than those of signalized intersections between 1600pcph and 3600pcph. (CASE A is the condition with one exclusive left-turn lane and one shared straight lane with right-turn.) But, when entering traffic volumes are more than 4000pcph, vehicle's $CO_2$ emissions in signalized intersections is lower than those of roundabouts. CONCLUSIONS : It may be concluded that vehicle's $CO_2$ emissions on roundabouts are much lower than those of signalized intersections, especially, when entering traffics volumes are between 1600pcph and 3600pcph in 1-lane or 2-lane approaches.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.211-219
• /
• 2013

Human-centered computing (HCC) as a field was defined several years ago. Since then, the Web has grown significantly, and so has its impact in society at every level, creating the grounds for a new Web science. In this paper, we examine the definitions of HCC and Web science, and discuss how they might be related. On the one hand, HCC can be viewed as a set of methodologies, and on the other hand, Web science can be viewed as a platform or repository, from which behavioral data can be drawn. We examine the relationship between the two, and summarize three different research approaches that in many ways show this intersection.

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