• 한국CDE학회논문집
• /
• 제9권2호
• /
• pp.158-163
• /
• 2004

Curve tessellation, which generates a sequence of points from a curve, is very important for curve rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal deviation. Our approach has two merits. One is that it guarantees satisfaction of a given tolerance, and the other is that it can be applied in not only a polynomial curve but its offset. Especially the point sequence generated from an original curve can cause over-cutting in NC machining. This problem can be solved by using the point sequence generated from the offset curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• 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.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제28권4호
• /
• pp.399-411
• /
• 2021

We consider a Weierstrass semigroup at a generalized flex on a smooth plane curve. We find the candidates of a Weierstrass semigroup at a 2-flex of higher multiplicity on a smooth plane curve of degree d ≥ 5, and give some examples to show the existence of them.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제2권3호
• /
• pp.237-241
• /
• 2002

In this paper, we describe how to represent hand witten decimal digits by a sequence of one to five fuzzy sets. Each fuzzy set represents an arc segment of the digit and is a Cartesian product of four fuzzy sets; the first is fur the arc length of the segment, the second is for the arc direction, the third is fur the arc shape, and the fourth is a crisp number indicating whether it has a junction point and if it has an end point of a stroke. We show that an arbitrary pair of these sequences representing two different digits is mutually disjoint. We also show that various forms of a digit written in different styles can be represented by the same sequence of fuzzy sets and hence the deviations due to different writers can be modeled by using these fuzzy sets.

• Bulletin of the Korean Chemical Society
• /
• 제18권1호
• /
• pp.38-43
• /
• 1997

Poly(ethylene 2, 6-naphthalate-co-tetramethylene 2, 6-naphthalate) (PEN/PBN) copolymers were synthesized and studied by 13C NMR spectroscopy, DSC analysis and X-ray diffraction. A minimum in the melting point vs. composition curve was found at approximately 60 mol% tetramethylene 2, 6-naphthalate. The PEN/PBN copolymers were shown to be statistically random throughout the range of 1, 4-butanediol compositions. The melting point depression behavior of annealed PEN/PBN copolymers depended upon the sequence propagation probability, PS, which is suggested by indivisual crystal formation of two pure comonomers; that is, ethylene-naphthalate-ethylene, EE, and tetramethylene-naphthalate-tetramethylene, BB. However, it can be seen from the X-ray curve that the peaks of PEN/PBN copolymers appear from a crystal lattice which is governed only by the rich component between two different aliphatic units in the copolymer composition.

• 전기학회논문지
• /
• 제56권1호
• /
• pp.188-196
• /
• 2007

In this paper we propose an efficient offset curve generation algorithm for open and closed 2D point sequence curve(PS curve) with line segments in the plane. One of the most difficult problems of offset generation is the loop intersection problem caused by the interference of offset curve segments. We propose an algorithm which removes global as well as local intersection loop without making an intermediate offset curve by forward tracing of tangential circle. Experiment in computer sewing machine shows that proposed method is very useful and simple.

• Journal of information and communication convergence engineering
• /
• 제7권4호
• /
• pp.545-550
• /
• 2009

A method fully utilizing multiscale line filter responses is presented to estimate the point spread function(PSF) of a CT scanner and diameters of small tubular structures based on the PSF. The estimation problem is formulated as a least square fitting of a sequence of multiscale responses obtained at each medical axis point to the precomputed multiscale response curve for the ideal line model. The method was validated through phantom experiments and demonstrated through phantom experiments and demonstrated to accurately measure small-diameter structures which are significantly overestimated by conventional methods based on the full width half maximum(FWHM) and zero-crossing edge detection.

• 한국산학기술학회논문지
• /
• 제11권9호
• /
• pp.3155-3160
• /
• 2010

최근 자동차 산업은 고효율 자동차의 개발에 박차를 가하고 있으며 이에 따라 차체 경량화 및 내식성 방지를 위한 고강도강 및 도금강의 사용이 증가하고 있다. 이에 따라 본 연구에서는 자동차 차체에 쓰이는 3종의 다른 강판에 대하여, 겹침 순서에 따른 용접 특성을 시뮬레이션 기법을 이용하여 분석하였다. 자동차 차체에 많이 사용되는 EDDQ 급의 도금강판 0.7t와 인장강도 440 MPa급의 440R 1.2t, 그리고 AHSS (Advanced High Strength Steel)인 DP 590 0.2t 판재에 대하여 겹치기 순서에 따른 용접 특성을 시뮬레이션 하였고, 너겟 성장 곡선 및 전류에 따른 너겟의 크기로 그 용접성을 분석하였다. 또한 용접 시 발생되는 각 접촉부의 접촉저항을 이용하여 겹침순서에 따른 너겟의 크기를 분석하였으며, 이를 통해 최적의 겹치기 순서를 제안할 수 있었다.

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