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

This paper addresses B-spline curve approximation of a set of ordered points to a specified toterance. The important issue in this problem is to reduce the number of control points while keeping the desired accuracy in the resulting B-spline curve. In this paper we propose a new method for error-bounded B-spline curve approximation based on adaptive selection of dominant points. The method first selects from the given points initial dominant points that govern the overall shape of the point set. It then computes a knot vector using the dominant points and performs B-spline curve fitting to all the given points. If the fitted B-spline curve cannot approximate the points within the tolerance, the method selects more points as dominant points and repeats the curve fitting process. The knots are determined in each step by averaging the parameters of the dominant points. The resulting curve is a piecewise B-spline curve of order (degree+1) p with $C^{(p-2)}$ continuity at each knot. The shape index of a point set is introduced to facilitate the dominant point selection during the iterative curve fitting process. Compared with previous methods for error-bounded B-spline curve approximation, the proposed method requires much less control points to approximate the given point set with the desired shape fidelity. Some experimental results demonstrate its usefulness and quality.

• 전자공학회논문지B
• /
• 제31B권5호
• /
• pp.1-11
• /
• 1994

In computer graphics since objects atre constructed by lines and curves, the high-speed curve generator is indispensible for computer aided design and simulatation. Since the functions of graphic generation can be represented as a series of matrix operations, in this paper, two kind of the high-speed Bezier curve generator that uses matrix equation and a recursive relation for Bezier polynomials are designed. And B-spline curve generator is designed using interdependence of B-spline blending functions. As the result of the comparison of designed curve generator and reference [5], [6] in the operation time and number of operators, the curve generator with 1-dimensional systolic array processor for matrix vector operation that uses matrix equation for Bezier curve is more effective.

• 정보보호학회논문지
• /
• 제9권1호
• /
• pp.85-102
• /
• 1999

본 논문에서는 ECDLP(Elliptic Curve Discrete Logarithm Problem)를 이용한 EC-SRP (Elliptic Curve - Secure Remote Password) 프로토콜을 제안한다. 타원곡선 이산대수 문제를 SRP(Secure Remote Password) 프로토콜에 적용시킴으로써 타원 곡선이 갖는 높은 효율성과 보안성을 갖도록 하였으며, 이와 동시에 타원곡선의 스칼라 곱셈(scala. multiplication)의 회수를 최대한 줄임으로써 최적의 효율성을 갖도록 설계하였다. 또한 랜덤 오라클(random, oracle) 모델에서 EC-SRP 프로토콜이 안전한 AKC(Athenticated Key Agreement with Key Confirmation)프로토콜임을 증명하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.474-479
• /
• 2003

This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2000년도 춘계정기학술대회 e-Business를 위한 지능형 정보기술 / 한국지능정보시스템학회
• /
• pp.475-478
• /
• 2000

Recently encryption algorithms based on difficulties of factorization have been used with popularization. Prime number factorizations are progressed rapidly. In this paper, characteristics of elliptic curve are analyzed and generation of elliptic curves suitable for prime number factorization is discussed.

• 한국농공학회:학술대회논문집
• /
• 한국농공학회 1999년도 Proceedings of the 1999 Annual Conference The Korean Society of Agricutural Engineers
• /
• pp.493-498
• /
• 1999

To extract hydrologic information more easily , the pre-processor for hydrologic model using Geographic Information System was developed . This model was applied to the Balan-reservoir watershed which is located at the southwest of Suwon. For estimation SCS curve number, landuse map and hydrologic soil group map were collected from digital map and reconnaissance soil map respectively. The estimated curve number from the GIS technique was 73.

• 한국환경생태학회지
• /
• 제9권2호
• /
• pp.197-201
• /
• 1996

빈도측정을 고려한 삼림군집구조 조사시 관목층의 적정 조사구수를 결정하기 위하여 오대산국립공원지역 젓나무-활엽수 혼효림군집의 관목층을 대상으로 30개의 5m*5m 조사구를 설치한 후 종수-면적 곡선, performance curve 등을 적용하였다. 종수-면적 곡선에 있어서 누적조사구수의 증가율보다 출현종수의 증가율이 낮은 최소 조사구수는 6개였으며, 누적조사구수의 증가율에 비하여 출현종수의 증가율이 1/2 이하인 최소 조사구수는 11개이었다. 주요 수종의 중요치에 의한 performance curve를 작성한 결과 우점종과 준우점종의 구분이 뚜렷해지는 최소 조사구수는 5개이었으며, 준우점종 중 제 1의 준우점종이 구분되는 최소 조사구수는 10개이었다. 본 조사지를 대표한다고 할 수 있는 전체 조사구수 30개와 비교할 때, 종다양도는 조사구수 5개 이상에서 0.05 이하의 차이를 보였으며, 유사도지수는 조사구수 5개 이상에서 70% 이상, 10개 이상에서 80% 이상의 값을 보였다. 이상의 결과를 종합하면 본 조사지인 젓나무-활엽수 혼효림군집 관목층의 무작위표본추출법에 의한 5m*5m 크기의 적정조사구수는 일반적인 경우 대체로 5개, 보다 정확성을 요구할 경우 대체로 10개이었다.

• 한국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학회논문집
• /
• 제5권2호
• /
• pp.168-174
• /
• 2000

A biarc is a curve connecting two circular arcs with the constraints of tangent continuity so that it can represent the free form currie approximately connecting several biarcs with the tangent continuity. Since a biarc consists of circular arcs, the offset curve of the curve represented by biarcs can be easily obtained. Besides. if the tool path is represented by biarcs, the efficiency of machining is improved and the amount of data is decreased. When approximating a curve with biarcs, the location of the point where two circular arcs meet each other plays an important part in determining the shape of a biarc. In this thesis, the optimum point where two circular arcs meet is calculated using the tangent information of the curve to approximate so that it takes less calculation time to approximate due to the decrease of the number of iterations.

• 정보학연구
• /
• 제5권1호
• /
• pp.99-111
• /
• 2002

원 영상에 근접한 색채 재현을 위한 선형 변환을 이용한 영상의 컬러 보정은 컬러 공간의 비 선형성으로 인해 색의 왜곡 현상이라는 문제가 발생하게 된다. 이러한 문제를 극복하기 위해 선형 이론인 임의의 평면상에 주어진 자료점들로 구성되는 베지어 곡선이 사용되어 왔다. 그러나, 이 베지어 곡선은 자료점의 개수에 따라 차수가 증가하게 되므로 수치적 계산상의 많은 제약을 받게 된다. 본 논문에서는 각 구간에서나 전체 구간에서의 차수가 3차이면서 베지어 곡선의 특성을 갖는 "3중첩 구간적 베지어 3차 곡선"(TPBC Curve; Triplicated Piecewise Bezier Cubic Curve)를 이용하였다. 이에 따른, TPBC-곡선과 20차 베지어 곡선을 이용하였을 때와 비교하여 컬러 보정 시 발생하는 왜곡 현상, 그리고 좁은 영역의 컬러 보정으로 인한 작업량의 증가를 감소시킨 결과를 보여주고자 한다. 보여주고자 한다.