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

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.854-858
• /
• 2001

본 논문에서는 평면 형상에 대한 꼬임(self-intersection)의 발생을 배제한 계층적 표현을 제안하였다. 기존의 계층적 표현들에서는 실제 활용에 많은 문제를 초래하는 꼬인 형상의 발생을 피할 수 없으며, 이는 반드시 제거될 필요가 있다. 그러나 n개의 점으로 구성된 형상의 고임 문제를 해결하는 데는 O(n$^2$)의 계산량이 요구되므로, 본 논문에서는 계층적 지역화의 경계 영역간 교차 상태를 나타내는 cross-link 개념을 도입하여 효율적으로 해결할 수 있는 꼬임 해결 알고리즘을 제안하고 실험을 통해 그 효율성을 확인하였다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.626-630
• /
• 1996

The most important problem in NC machining of a freeform mold surface is removal of tool interference. In this paper three methods are introduced to remove self-intersection on offsetted freeform surface for 3-axis NC. All methods are using intersectional offset curves on original offset surface. The fast method is sequential loop check using two lines which have two neighbor points of intersectional offset curves.

• International Journal of CAD/CAM
• /
• v.2 no.1
• /
• pp.23-28
• /
• 2002

This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all self-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to sweep-line directions. The proposed algorithm has been implemented in Visual C++ and applied to offset point sequence curves, which contain several islands.

• Honam Mathematical Journal
• /
• v.45 no.4
• /
• pp.648-654
• /
• 2023

Schwarz lemma at the non-smooth boundary point for holomorphic self-map on the intersection of two balls in ℂ² is obtained. At the complex tangent point in the corner of the boundary of the domain, the tangential eigenvalue of the complex Jacobian of the holomorphic map is estimated if the map is transversal.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.1022-1030
• /
• 2003

In this paper we propose a efficient offset curve construction algorithm for $C^0$-continuous Open and Closed 2D sequence curve with line segment in the plane. One of the most difficult problems of offset construction is the loop problem caused by the interference of offset curve segments. Prior work[1-10] eliminates the formation of local self-intersection loop before constructing a intermediate(or raw) offset curve, whereas the global self-intersection loop are detected and removed explicitly(such as a sweep algorithm[13]) after constructing a intermediate offset curve. we propose an algorithm which removes global as well as local intersection loop without making a intermediate offset curve by forward tracing of tangential circle. Offset of both open and closed poly-line segment sequence curve in the plane constructs using the proposed approach.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.862-873
• /
• 2023

Determining whether an autonomous self-driving agent is in the middle of an intersection can be extremely difficult when relying on visual input taken from a single camera. In such a problem setting, a wider range of views is essential, which drives us to use three cameras positioned in the front, left, and right of an agent for better intersection recognition. However, collecting adequate training data with three cameras poses several practical difficulties; hence, we propose using data collected from one camera to train a three-camera model, which would enable us to more easily compile a variety of training data to endow our model with improved generalizability. In this work, we provide three separate fusion methods (feature, early, and late) of combining the information from three cameras. Extensive pedestrian-view intersection classification experiments show that our feature fusion model provides an area under the curve and F1-score of 82.00 and 46.48, respectively, which considerably outperforms contemporary three- and one-camera models.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.547-568
• /
• 2020

In this paper, we introduce the linear self-attracting diffusion driven by a weighted fractional Brownian motion with weighting exponent a > -1 and Hurst index |b| < a + 1, 0 < b < 1, which is analogous to the linear fractional self-attracting diffusion. For the 1-dimensional process we study its convergence and the corresponding weighted local time. As a related problem, we also obtain the renormalized intersection local time exists in L² if max{a₁ + b₁, a₂ + b₂} < 0.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.133-140
• /
• 2009

Presented in this paper is a method to generate round-endmill toolpaths for sculptured surfaces represented as a triangular mesh model. The proposed method is applicable in toolpath generation for ball-endmills and flat-endmills because the round-endmill is a generalized tool in three-axis NC (numerical control) milling. The method uses a wireframe model as the offset model that represents a cutter location surface. Since wireframe models are relatively simple and fast to calculate, the proposed method can process large models and keep high precision. Intersection points with the wireframe offset model and a tool guide plane are calculated, and intersection curves are constructed by tracing the intersection points. The final step of the method is extracting regular curves from the intersection curves including degenerate and self-intersected segments. The proposed method is implemented and tested, and a practical example is presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.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.