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

• 한국컴퓨터그래픽스학회논문지
• /
• 제6권4호
• /
• pp.29-34
• /
• 2000

이 논문에서는 평행이동곡면 (surface of extrusion) 과 임의의 자유곡면 사이의 교차곡선의 구조를 분석하고 이를 계산하는 방법에 대해 설명한다. 평행이동곡면의 이동방향에 대하여 다른 곡면의 윤곽곡선 (silhouette curve) 을 구하고, 이를 평행이동곡면의 기준곡선과 교차시킴으로써 교차곡선의 구조를 분석한다. 또한, 교차곡선이 존재하는 범위와 특이점을 구함으로써 교차곡선 전체를 안정적이고 효율적으로 계산하는 알고리즘을 제시한다.

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

This paper presents d new algorithm to compute the offlet curve of a given planar parametric curve. We reduce the problem of computing an offset curve to that of intersecting a surface to a paraboloid. Given an input curve C(t)=(x(t), y(t))∈R², the corresponding surface D/sub c(t)/ is constructed symbolically as the envelope surface of a one-parameter family of tangent planes of the paraboloid Q:z=x²+y²along a lifted curve C(t)=(x(t), y(t), x(t)²+y(t)²∈Q. Given an offset distance d∈R, the offset curve C/sub d/(t) is obtained by the projection of the intersection curve of D/sub c(t)/ and a paraboloid Q:z=x²+y²-d² into the xy-plane.

• 대한기계학회논문집
• /
• 제19권8호
• /
• pp.1832-1843
• /
• 1995

Tool interference is one of the most critical problems in sculptured surface machining. When machining cavities and concaves, the tool frequently overcuts the portions of the surface, which cause inaccuracy in machining. So tool interference-free paths must be generated for rough cutting more efficiently. In this paper a software using SSI(Surface/Surface intersection) algorithm is developed for eliminating tool interference which occurs in an offset surface in 3-dimensional free form surface modeling. this work consists of two stages : using the offset data, the intersection curves are rapidly checked by this algorithm at the first stage. CL(cutter location) data are obtained by deleting the loop section of intersected offset patches at the second stage. This algorithm can reduce the amount of memory required to store machining data and also easily check region which have the possibility of intersection. Also, This software is verified to be useful in machining a curved object on a DNC milling machine.

• 한국정보처리학회논문지
• /
• 제4권8호
• /
• pp.2163-2172
• /
• 1997

곡면간의 교차계산은 부울연산(Boolean operations)과 조각된 곡면들을 지원하기위한 기하 모델링과 솔리드에서 사용되는 기본적인 기하학 연산이다. 본 논문에서는 두 정규화된 곡면의 교차곡선을 따라 추적하기 위한 새로운 알고리즘을 제안한다. 그러므로 본 논문에서는 계산상의 간소화와 2차 연속성을 나타낸다. 따라서, 교차 곡선의 한 점이 주어지면 이 점을 초기점으로 하여 교차 곡선의 전체 곡선을 추적한다. 그리고 각각의 교선들의 초기점들은 쿼드트리에서 DFS(Depth First Search) 기법으로 검색되고 교선은 연속적인 형태로 자연스럽게 표현된다.

• 대한조선학회논문집
• /
• 제54권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.

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

• 대한산업공학회지
• /
• 제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.

• Bulletin of the Korean Chemical Society
• /
• 제35권4호
• /
• pp.1061-1066
• /
• 2014

Time-dependent formulations of the reactive scattering theory based on the wavepacket correlation functions with the M${\phi}$ller wavepackets for the electronically nonadiabatic reactions are presented. The calculations of state-to-state reactive probabilities for the quasi-Jahn-Teller scattering model system were performed. The conical intersection (CI) effects are investigated by comparing the results of the two-surface nonadiabatic calculations and the single surface adiabatic approximation. It was found that the results of the two-surface nonadiabatic calculations show interesting features in the reaction probability due to the conical intersection. Single surface adiabatic calculations with extended Born-Oppenheimer approximation using simple wavepacket phase factor was found to be able to reproduce the CI effect semi-quantitatively, while the single surface calculations with the usual adiabatic approximation cannot describe the scattering process for the Jahn-Teller model correctly.