• 한국CDE학회논문집
• /
• 제11권1호
• /
• pp.20-26
• /
• 2006

This paper presents a procedure to compute pencil curves from a triangular mesh which is offset with the radius of a given ball-end mill. An offset triangular mesh has numerous self-intersections caused by an abundance of invalid triangles, which do not contribute to the valid CL-surface. Conceptually, we can obtain valid pencil curves by combining all intersections tying on the outer skin of the offset triangular mesh, i.e., the valid CL-surface. The underlying concept of the proposed algorithm is that visible intersections are always valid for pencil curves, because visible intersections lie on the outer skin of the offset model. To obtain the visibility of intersections efficiently, the proposed algorithm uses a graphics board, which performs hidden surface removal on up to a million polygons per second.

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

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

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

• 한국정보통신학회논문지
• /
• 제14권9호
• /
• pp.2016-2022
• /
• 2010

점들의 집합으로부터 곡선이나 곡면을 구성하는 문제는 기하학적 모델링, 컴퓨터그래픽스, 영상처리 등의 분야에서 중요한 역할을 수행하고 있다. 특히 곡선 재구성 문제는 기존에 존재하는 곡선으로부터 샘플링된 점들로부터 순서를 부여하여 점들을 연결하는 문제이다. 이러한 문제에 대한 대부분의 기존 방법들은 유클리언 거리를 기초로 하고 있기 때문에 자기교차를 가지고 있는 곡선의 재구성 문제를 해결하지 못하고 있는 실정이다. 본 논문에서는 이러한 문제점을 해결하기 위하여 방향도 함께 고려하는 거리를 제안하고, 이를 이용하여 데이터 점들에게 순서를 부여하는 알고리즘을 제안한다. 본 논문에서 제안하는 거리함수는 브라운 운동의 확산 특성을 반영한 것으로서, 다음 점의 위치에 대한 정보를 표준정규분포로 전환함에 의해서 유도되었다. 본 논문의 우수성은 기존의 방법으로는 해결하지 못했던 자기교차 곡선 재구성 문제를 해결할 수 있다는 점이다.

• 한국정밀공학회지
• /
• 제26권1호
• /
• pp.63-70
• /
• 2009

Proposed in the paper is an algorithm to generate tool-path for sculptured surface machining. The proposed algorithm computes tool path by slicing offset triangular mesh, which is the CL-surface (Cutter Location surface). Since the offset triangular mesh includes invalid triangles and self-intersections, it is necessary to remove invalid portions. For the efficient removal of the invalid portions, we extended the sweep line algorithm. The extended sweep line algorithm removes invalid portions very efficiently, and it also considers various degeneracy cases including multiple intersections and overlaps. The proposed algorithm has been implemented and tested with various examples.

• 한국CDE학회논문집
• /
• 제9권3호
• /
• pp.203-211
• /
• 2004

In this paper, we present a method of extracting a regular 2-manifold triangular net from a triangular net including degenerate and self-intersected triangles. This method can be applied to obtaining an offset model without degenerate and self-intersected triangles. Then this offset model can be used to generate CL curves and extract machining features for CAPP The robust and efficient algorithm to detect valid triangles by growing regions from an initial valid triangle is presented. The main advantage of the algorithm is that detection of valid triangles is performed only in valid regions and their adjacent selfintersections, and omitted in the rest regions (invalid regions). This advantage increases robustness of the algorithm. As well as a k-d tree bucketing method is used to detect self-intersections efficiently.

• 대한수학회지
• /
• 제36권2호
• /
• pp.267-298
• /
• 1999

A geometric construction of an exact algebraic formula for graded partition functions, of which a special one is the classical unrestricted partition function p(n), from a diophantine point of view is presented. Moreover, the involved process allows us to compute the value of a graded partition function in an inductive manner with a geometrically built-in self-error-checking ability at each step for correctness of the computed values of the partition function under consideration.

• 대한교통학회지
• /
• 제21권2호
• /
• pp.63-70
• /
• 2003

실시간 교차로의 대기행렬길이 검지는 지능형교통체계의 중요부분인 교통관제를 위해서 매우 중요하다. 특히 교통정보수집을 위한 영상기반 기술은 전통적인 루프검지기 또는 기타 타 검지기에 비하여 내재된 여러 이점 때문에 많은 연구가 진행되어 왔다. 그러나 현장 적용시 흔히 발생하는 영상에서의 잡음 및 주변 물체로부터 투영되는 음영 등에 의해 나타나는 차량의 오검지율을 줄이고 수집되는 교통정보의 신뢰도를 높이기 위해서는 보다 효과적인 알고리즘개발이 요구된다. 본 연구에서는 영상처리를 이용한 대기행렬길이 검지를 위한 알고리즘을 제시하였다. 실시간 데이터 수집 및 분석 그리고 패턴분석에 우수한 것으로 알려진 신경망 모형을 이용하였으며, 특히 시스템 신뢰성을 높이기 위하여 퍼지이론이 접목된 퍼지 뉴런모델인 Fuzzy ARTMAP을 모형에 도입하였다. 실험결과 본 연구에서 제시한 대기행렬 측정 방법은 매우 우수한 검지 능력을 보였으며, 대기행렬 검지뿐만 아니라 신뢰성 높은 차량검지 및 차종분류를 위해서도 활용할 수 있을 것으로 기대된다.

• Smart Structures and Systems
• /
• 제21권6호
• /
• pp.715-725
• /
• 2018

Truss-Z (TZ) is an Extremely Modular System (EMS). Such systems allow for creation of structurally sound free-form structures, are comprised of as few types of modules as possible, and are not constrained by a regular tessellation of space. Their objective is to create spatial structures in given environments connecting given terminals without self-intersections and obstacle-intersections. TZ is a skeletal modular system for creating free-form pedestrian ramps and ramp networks. The previous research on TZ focused on global discrete geometric optimization of the spatial configuration of modules. This paper reports on the first attempts at structural optimization of the module for a single-branch TZ. The internal topology and the sizing of module beams are subject to optimization. An important challenge is that the module is to be universal: it must be designed for the worst case scenario, as defined by the module position within a TZ branch and the geometric configuration of the branch itself. There are four variations of each module, and the number of unique TZ configurations grows exponentially with the branch length. The aim is to obtain minimum-mass modules with the von Mises equivalent stress constrained under certain design load. The resulting modules are further evaluated also in terms of the typical structural criterion of compliance.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.