• 한국CDE학회논문집
• /
• 제9권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.

• 한국안전학회지
• /
• 제32권5호
• /
• pp.129-134
• /
• 2017

This study aims to develop the traffic accident models by circular intersection type using count data model. The number of accident, the number of fatal and injured persons(FSI), and EPDO are calculated from the traffic accident data of TAAS. The circular intersection accident models are developed through Poisson and negative binomial regression analysis. The main results of this study are as follows. First, the null hypotheses that there are differences in the number of traffic accidents, FSI and EPDO by type of circular intersections are rejected. Second, the scale of intersection(median, large), number of approach road, mean width and length of exit road, area of the circulating roadway and central island are selected as factors influencing the number of traffic accidents, FSI and EPDO in rotary. Third, the scale of intersection(median), guide signs(limited speed, direction, roundabout), number of approach road, entry angle, area of the intersection and central island are adopted as factors influencing the number of traffic accidents, FSI and EPDO in roundabout. Finally, transferring from rotary to roundabout could be expected to make the accident decrease.

• 한국CDE학회논문집
• /
• 제4권3호
• /
• pp.269-283
• /
• 1999

Surface/surface intersection is a common and important problem in geometric modeling and CAD/CAM. Several methods have been used to approach this problem. All possible intersection curves can be obtained by using the subdivision algorithm, while it requires a great deal of memory and is somewhat inefficient. The tracing algorithm is much faster than the subdivision algorithm, and can find points on the intersection curve sequentially. But, the tracing algorithm has some problems in the intersection curves on surface boundaries. In this paper, an Improved tracing algorithm that includes some ideas such as a new trace-terminating condition for the intersection curves on surface boundaries, detecting closed intersections and extension for composite surfaces is suggested. This algorithm consists of three step: generating state points for curve tracing, tracing intersection curves and sorting pieces of the intersection curves. The results of this algorithm and comparisons to the 'DESIGNBASE' and 'ACIS' system are presented.

• 대한교통학회지
• /
• 제14권3호
• /
• pp.127-141
• /
• 1996

This paper presents a unique approach to urban traffic network signal control. This paper begins with an introduction to traffic control in general, and then goes on to describe the approach of fuzzy control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic network condition and adjacent intersection. The signal timing parameters evolve dynamically using only local information to improve traffic signal flow. The signal timing at an intersection is defined by three parameters : cycle time, phase split, off set. Fuzzy decision rules are used to adjust three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. In this paper the effectiveness of this method is showed through simulation of the traffic signal flow in a network of controlled intersection.

• 대한교통학회지
• /
• 제6권2호
• /
• pp.49-56
• /
• 1988

Alternate use of lane at a signalized intersection is a quite different control of the operation of an intersection. This control introduces a new stop line and signal before the original stop line. All of the lanes between the two stop lines are used for left turn traffic or through traffic at a time. The purpose of the control is increasing the capacity of a n intersection without widening the approach width. this paper contains a study on the condition of a application, the proper distances between the two stop lines, the reasonable offsets(rear) to guarantee clearing the vehicles of previous phase, the comparison of approach capacity between the existing control and this control. The study results reveals that the offsets(rear) are rather stable showing the range(maximum value minus minimum value) of it's value does not exceed 3.6 seconds according to the field data. The approach capacity will be increased by 27%, 43%, 59%, 84% when the distances between the stop lines are 30.0m respectively. The control might have theoretical limitation to operate in practice. So an experimental application of the control at some suitable intersections prior to expanding it.

• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.101-110
• /
• 2001

The maximum intersection of spherical convex polygons are to find spherical regions owned by the maximum number of the polygons, which is applicable for determining the feasibility in manufacturing problems such mould design and numerical controlled machining. In this paper, an efficient method for partitioning a sphere with the polygons into faces is presented for the maximum intersection. The maximum intersection is determined by examining the ownerships of partitioned faces, which represent how many polygons contain the faces. We take the approach of edge-based partition, in which, rather than the ownerships of faces, those of their edges are manipulated as the sphere is partitioned incrementally by each of the polygons. Finally, gathering the split edges with the maximum number of ownerships as the form of discrete data, we approximately obtain the centroids of all solution faces without constructing their boundaries. Our approach is analyzed to have an efficient time complexity Ο(nv), where n and v, respectively, are the numbers of polygons and all vertices. Futhermore, it is practical from the view of implementation since it can compute numerical values robustly and deal with all degenerate cases.

• 한국CDE학회논문집
• /
• 제5권4호
• /
• pp.336-346
• /
• 2000

This paper presents a geometric method that can detect and compute all conic sections in the intersection of two tori. Conic sections contained in a torus must be circles. Thus, when two tori intersect in a conic section, the intersection curve must be a circle as well. Circles in a torus are classified into profile circles, cross-sectional circlet, and Yvone-Villarceau circles. Based on a geometric classification of these circles, we present a procedural method that can detect and construct all intersection circles between two tori. All computations can be carried out using simple geometric operations only: e.g., circle-circle intersections, circle-line intersections, vector additions, and inner products. Consequently, this simple structure makes our algorithm robust and efficient, which is an important advantage of our geometric approach over other conventional methods of surface intersection.

• 대한교통학회지
• /
• 제14권2호
• /
• pp.45-58
• /
• 1996

In a large signal intersection, it is the most important to set phase sequences and phase intervals of traffic signal in order to improve the efficiency of the capacity as well as safety. These setting allows to select the best sequence of signal phase among several alternatives, and thus to rearrange the starting and ending points of the individual phase using an effective interphase periods (EIP). The EIP is a gap between previous and current traffic movements at a potential collision point in an intersection. Each of traffic movements has an equality for safety and efficiency at the balanced condition of EIP. This paper presents how to set optimally the phase sequences and intervals of traffic signal in an intersection using phase based approach. And in the second part, we applied the theory developed in the first part. In particular, a numerical example of phase base signal setting is presented using a matrix computation method in order to select the best sequence among several alternatives, and thus to rearrange the starting and ending points of the individual phase using the EIP. This method also allows to apply to optimum signal setting even in five-lag or staggered-type intersection.

• 한국도로학회논문집
• /
• 제15권6호
• /
• pp.125-133
• /
• 2013

PURPOSES : The purpose of this study is to propose delay-minimizing operation methodology of a signalized intersection based upon optimization of lane-uses on approaching lanes for an intersection. METHODS : For the optimization model of lane-uses, a set of constraints are set up to ensure feasibility and safety of the lane-uses, traffic flow, and signal settings. Minimization of demand to saturation flow ratio of a dual-ring signal control system is introduced to the objective function for delay minimization and effective signal operation. Using the optimized lane-uses, signal timings are optimized by delay-based model of TRANSYT-7F. RESULTS : It was found that the proposed objective function is great relation with delay time for an intersection. From the experimental results, the method was approved to be effective in reducing delay time. Especially, cases for two left-turn lanes reduced greater delays than those for a left turn lane. It is noticed that the cases for different traffic volume by approach reduced greater delays than those for the same traffic volume by approach. CONCLUSIONS : It was concluded that the objective function is proper for lane-uses optimizing model and the operation method is effective in reducing delay time for signalized intersections.

• 대한산업공학회지
• /
• 제19권3호
• /
• pp.123-137
• /
• 1993

In this paper, an integrated approach is proposed to generate gouging-free Cartesian tool paths for machining sculptured surfaces from 3D measurement data. The integrated CAD/CAM system consists of two modules : offset surface module an Carteian tool path module. The offset surface module generates an offset surface of an object from its 3D measurement data, using an offsetting method and a surface fitting method. The offsetting is based on the idea that the envelope of an inversed tool generates an offset surface without self-intersection as the center of the inversed tool moves along on the surface of an object. The surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of data points. The resulting offset surtace is a composite Bezier surface without self-intersection. When an appropriate tool-approach direction is selected, the tool path module generates the Cartesian tool paths while the deviation of the tool paths from the surface stays within the user-specified tolerance. The tool path module is a two-step process. The first step adaptively subdivides the offset surface into subpatches until the thickness of each subpatch is small enough to satisfy the user-defined tolerance. The second step generates the Cartesian tool paths by calculating the intersection of the slicing planes and the adaptively subdivided subpatches. This tool path generation approach generates the gouging-free Cartesian CL tool paths, and optimizes the cutter movements by minimizing the number of interpolated points.