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

This paper describes a method of calculating the feedrate for the constant cutting speed at a CL-point in 5-axis machining. Unlike 3-axis machining, 5-axis machining has the flexibility of the tool motions due to two rotation axes. But the feedrate at joint space differs from the feedrate at a tool tip(the CL-point) of the 3D Euclidean space for the tool motions. The proposed algorithm adjusts the feedrate based on 5-axis NC data, the kinematics of a machine, and the tool length. The following calculations is processed for each NC block to generate the new feedrate; 1) calculating the moving distance at the CL-point, 2) calculating the moving time by the given feedrate, 3) calculating the feedrate of each axis, 4) getting the new feedrate. The proposed algorithm was applied to a 5-axis machine which had a tilting spindle and a rotary table. Totally, the result of the algorithm reduced the machining time and smoothed the cutting-load by the constant cutting speed at the CL-point.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• 한국정보전자통신기술학회논문지
• /
• 제2권3호
• /
• pp.79-86
• /
• 2009

본 논문은 피부색 요소의 유클리디안거리를 계산 얼굴영역을 추출하고 얼굴의 특징요소를 추출하는 방법을 제안하였다. 제안한 알고리즘은 조명보정과 얼굴 검출 과정으로구성되었다. 조명보정 과정에서는 조명변화에 대한 보정기능을 수행한다. 얼굴 검출 과정은 20개의 피부색 표본영상에서 색상과 채도를 특징벡터로 사용, 입력영상과의 유클리디안 거리를 구하여 피부색 영역을 추출하였다. 추출된 얼굴 후보영역에서 CMY칼라 모델 C공간에서 눈을 검출 하였고, YIQ 칼라 모델 Q공간에서 입을 검출하였다. 추출된 얼굴 후보영역에서 일반적인 얼굴에 대한 지식을 기반으로 얼굴 영역을 검출하였다. 입력받은 40개의 정면 칼라 영상으로 실험한 결과 100%의 얼굴 검출율을 보였다.

• 대한수학회지
• /
• 제45권3호
• /
• pp.781-794
• /
• 2008

Let $\mathbb{H}_g$ and $\mathbb{D}_g$ be the Siegel upper half plane and the generalized unit disk of degree g respectively. Let $\mathbb{C}^{(h,g)}$ be the Euclidean space of all $h{\times}g$ complex matrices. We present a partial Cayley transform of the Siegel-Jacobi disk $\mathbb{D}_g{\times}\mathbb{C}^{(h,g)}$ onto the Siegel-Jacobi space $\mathbb{H}_g{\times}\mathbb{C}^{(h,g)}$ which gives a partial bounded realization of $\mathbb{H}_g{\times}\mathbb{C}^{(h,g)}$ by $\mathbb{D}_g{\times}\mathbb{C}^{(h,g)}$. We prove that the natural actions of the Jacobi group on $\mathbb{D}_g{\times}\mathbb{C}^{(h,g)}$. and $\mathbb{H}_g{\times}\mathbb{C}^{(h,g)}$. are compatible via a partial Cayley transform. A partial Cayley transform plays an important role in computing differential operators on the Siegel Jacobi disk $\mathbb{D}_g{\times}\mathbb{C}^{(h,g)}$. invariant under the natural action of the Jacobi group $\mathbb{D}_g{\times}\mathbb{C}^{(h,g)}$ explicitly.

• 한국통신학회논문지
• /
• 제19권10호
• /
• pp.1925-1934
• /
• 1994

본 논문은 복잡성을 고려한 비일정 주파수 간격 트렐리스 부화화된 4-ary 연속위상 FSK의 성능개선 방법을 연구하였다. 비일정 주파수 생성을 위하여 비일정 대응기를 이용하였으며, 유사한 대역폭에서 비교를 위하여 심벌 대응시 최대 심벌 값을 3, -3으로 고정하였고, 트렐리스 나비선도의 대칭성을 위해 -1 및 1의 심벌 값만을 좌우대칭으로 0.5부터 3.0까지 변화시켰다. 트렐리스도에 기초한 알고리즘을 이용하여 오율성능의 매개변수인 자유거리를 모든 부호기/대응기 조합에 대하여 구하고, 그 특성을 분석하였다.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1661-1668
• /
• 2015

We study the Gauss map G of ruled surfaces in the 3-dimensional Euclidean space $\mathbb{E}^3$ with respect to the so called Cheng-Yau operator ${\Box}$ acting on the functions defined on the surfaces. As a result, we establish the classification theorem that the only ruled surfaces with Gauss map G satisfying ${\Box}G=AG$ for some $3{\times}3$ matrix A are the flat ones. Furthermore, we show that the only ruled surfaces with Gauss map G satisfying ${\Box}G=AG$ for some nonzero $3{\times}3$ matrix A are the cylindrical surfaces.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2011년도 정기 학술대회
• /
• pp.504-507
• /
• 2011

3D graphic softwares have brought design spaces beyond the limitations of Euclidean space. Moreover, as computational geometry has been considered together with algorithms, generative algorithms are being evolved. Recently 3D graphic softwares with the embedded generative algorithms allow designers to design free form curves and surfaces in a systematic way. While architectural design has been greatly affected by the advancement of 3D graphic technology, such attention has not given in the realm of structural design. Grasshopper is a platform in Rhino to deal with these Generative Algorithms and Associative modelling techniques. This study has tried to develop a module for preliminary structural configuration using Rhino with Grasshopper. To verify the proposed concept in this study, a module for designing a basic type of suspension structure is introduced.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제20권3호
• /
• pp.149-158
• /
• 2013

In this article, we study the Gauss map of generalized slant cylindrical surfaces (GSCS's) in the 3-dimensional Euclidean space $\mathbb{E}^3$. Surfaces of revolution, cylindrical surfaces and tubes along a plane curve are special cases of GSCS's. Our main results state that the only GSCS's with Gauss map G satisfying ${\Delta}G=AG$ for some $3{\times}3$ matrix A are the planes, the spheres and the circular cylinders.

• 대한수학회보
• /
• 제46권6호
• /
• pp.1141-1149
• /
• 2009

In this article, we study surfaces of revolution without parabolic points in a Euclidean 3-space whose Gauss map G satisfies the condition ${\Delta}^hG\;=\;AG,A\;{\in}\;Mat(3,{\mathbb{R}}),\;where\;{\Delta}^h$ denotes the Laplace operator of the second fundamental form h of the surface and Mat(3,$\mathbb{R}$) the set of 3${\times}$3-real matrices, and also obtain the complete classification theorem for those. In particular, we have a characterization of an ordinary sphere in terms of it.

• 한국통신학회논문지
• /
• 제29권3A호
• /
• pp.324-330
• /
• 2004

본 논문에서는 STBC (space tine block codes)의 채널 정보를 이용하여 TCM(Trellis Coded Modulation) 복호기의 연산량을 감소시키는 복호 방법을 제안하였고 이를 하드웨어로 설계 및 검증한 결과를 제시한다. 제안한 방법은 바이어스 포인트 설정을 이용하여 부집합에 n개의 시그널 포인트가 존재할 경우 실제 TCM 복호기에서 연산되는 가지 값을 부집합에서 1개의 시그널 포인트만 필요로 한다. 그러므로 바이어스 포인트 설정을 사용하여 가장 가까운 시그널 포인트를 미리 찾아내어 연산량을 l/n로 줄일 수 있다. 16QAM 8subset 경우에 AED (absolute euclidean distance)연산을 하게 되면 곱셈은 37％, 가감산 41％, 비교는 25％의 연산량 감소 효과가 있다. 또한 본 논문에서는 제안된 STBC와 TCM이 결합된 복호기의 하드웨어 합성 결과를 제시한다. 논리 합성 결과 약 87.6K개의 게이트가 요구됨을 확인하였다.