• 한국CDE학회논문집
• /
• 제15권3호
• /
• pp.178-188
• /
• 2010

This paper addresses the problem of determining if two surfaces intersect tangentially or transversally in a mathematically consistent manner and approximating an intersection curve. When floating point arithmetic is used in the computation, due to the limited precision, it often happens that the decision for tangential and transversal intersection is not clear cut. To handle this problem, in this paper, interval arithmetic is proposed to use, which provides a mathematically consistent way for such decision. After the decision, the intersection is traced using the validated ODE solver, which runs in interval arithmetic. Then an iterative method is used for computing the accurate intersection point at a given arc-length of the intersection curve. The computed intersection points are then approximated by using a B-spline curve, which is provided as one instance of intersection curve for further geometric processing. Examples are provided to demonstrate the proposed method.

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

• 한국CDE학회논문집
• /
• 제3권2호
• /
• pp.113-120
• /
• 1998

Calculation of intersection points by two curves is fundamental to computer aided geometric design. Bezier clipping is one of the well-known curve intersection algorithms. However, this algorithm is only applicable to Bezier curve representation. Therefore, the NURBS curves that can represent free from curves and conics must be decomposed into constituent Bezier curves to find the intersections using Bezier clipping. And the respective pairs of decomposed Bezier curves are considered to find the intersection points so that the computational overhead increases very sharply. In this study, extended Bezier clipping which uses the linear precision of B-spline curve and Grevill's abscissa can find the intersection points of two NURBS curves without initial decomposition. Especially the extended algorithm is more efficient than Bezier clipping when the number of intersection points is small and the curves are composed of many Bezier curve segments.

• 한국CDE학회논문집
• /
• 제12권5호
• /
• pp.344-353
• /
• 2007

In this paper, we address the problem of robust geometric modeling with emphasis on surface to surface intersections. We consider the topology and the numerical accuracy of an intersection curve to find the best approximation to the exact one. First, we perform the topological configuration of intersection curves, from which we determine the starting and ending points of each monotonic intersection curve segment along with its topological structure. Next, we trace each monotonic intersection curve segment using a validated ODE solver, which provides the error bounds containing the topological structure of the intersection curve and enclosing the exact root without a numerical instance. Then, we choose one approximation curve and adjust it within the bounds by minimizing an objective function measuring the errors from the exact one. Using this process, we can obtain an approximate intersection curve which considers the topology and the numerical accuracy for robust geometric modeling.

• 대한교통학회지
• /
• 제20권7호
• /
• pp.23-29
• /
• 2002

일반적으로 4지 또는 3지의 교차로가 설계·운영되고 있으나 적지 않게 5지 또는 그 이상 의 원형 신호교차로가 실질적으로 이용되고 있다. 접근로 수에 따른 교차로 형태별 분류에 의하면 5지 이상의 교차로에서의 상충지 점의 수는 4지 교차로의 그것보다 월등히 높아 설계지침에서도 4지 이하의 교차로를 설계할 것을 권하고 있으며 마찬가지로 5지 원형 신호교차로에서도 그 상충지점 수가 많다. 이러한 이유로 5지 신호 교차로의 신호 설계는 교통소통이 아닌 교통안전측면에서 신호현시 순서 및 길이가 결정되어야 할 필요가 있으며 또 그러한 현시순서는 교차로 내 원활한 교통의 흐름을 심각한 수준으로 방해하지 않을 필요가 있다. 본 연구에서는 5지 신호교차로의 안전을 고려한 현시순서설계 방안을 제시한다. 울산광역시에서 운영중인 공업탑 5지 신호교차로를 대상으로 현장자료를 수집하였으며, 신호시간 설계모형은 TRANSYT-7F를 적용했다. TRANSYT-7F에서의 최적 신호현시의 길이를 토대로 기본적으로 "한 현시에 2개 교통류의 이동" 원칙에 따라 재배열하였다. 제안된 방법으로 보정된 신호현시 순서 및 길이를 사용하여 모의실험한 결과 TRANSYT-7F에서 제시한 최적 신호현시 순서 및 길이를 적용한 것에 비하여 평균 6.2%지체도 증가가 있었으나 교차로 내 상충수를 61.5% 줄이는 결과를 도출하였다.

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

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

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.749-752
• /
• 2005

In this paper, we introduce an Intersection Collision Avoidance (ICA) system as a convergence example of Telematics and USN technology and show several requirements for the ICA system. Also, we propose a system design that satisfies the requirements of reliable vehicular data acquisition, real-time data transmission, and effective intersection collision prediction. The ICA system consists of vehicles, sensor nodes and a base station that can provide drivers with a reliable ICA service. Then, we propose several technological solutions needed when implementing the ICA system. Those are about sensor nodes deployment, vehicular information transmission, vehicular location data acquisition, and intersection collision prediction methods. We expect this system will be a good case study applied to real Telematics application based on USN technology.

• 대한교통학회지
• /
• 제17권5호
• /
• pp.79-86
• /
• 1999

우리 나라의 교통정체현상을 면밀히 분석해 보면 근본적으로는 차량에 비해 상대적으로 부족한 도로에 기인하지만, 도로의 용량 일관성 부재에서 교통정체현상이 발생하는 경우를 볼 수도 있다. 주요 간선도로가 만나는 교차로에서 인접교차로와의 교통류 패턴의 타이로 인해 주기, 같은 방향 현시의 길이 및 현시수의 변화로 인해서 발생한다. 특히 주요교차로에서 회전교통량으로 인한 현시수의 증가는 전체 간선도로의 용량 저하 및 간선도로의 연동효과를 저해해서 평균통행속도 및 용량을 감소시키는 주요 요인이다. 이와 같은 주요교차로의 병목현상이 인접교차로 및 전체 네트워크의 효율을 저하시키는 요인이 되고 있기 때문에 이에 대한 해결 방안으로 본 논문에서는 연속교차로의 개념을 소개하고, 이의 효율성을 분석하였다. 주요 연구내용으로는 우선 연속교차로의 개념 및 설계시 고려사항을 소개하고, 연속교차로의 효율성을 평가하기 위하여 NETSIM을 사용하여 평면 다현시 교차로와 연속교차로 및 입체교차로의 단순비교 분석을 실시하여, 지체도, 연료소모량 및 배기가스의 변화를 분석하였고, 좌회전 교통량의 변화에 따른 지체도 변화에 대한 민감도를 분석하였으며, 또한 경제성 분석을 통하여 연속교차로 설치 타당성을 분석하였다.