• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.127-134
• /
• 1998

This paper presents d new algorithm to compute the offlet curve of a given planar parametric curve. We reduce the problem of computing an offset curve to that of intersecting a surface to a paraboloid. Given an input curve C(t)=(x(t), y(t))∈R², the corresponding surface D/sub c(t)/ is constructed symbolically as the envelope surface of a one-parameter family of tangent planes of the paraboloid Q:z=x²+y²along a lifted curve C(t)=(x(t), y(t), x(t)²+y(t)²∈Q. Given an offset distance d∈R, the offset curve C/sub d/(t) is obtained by the projection of the intersection curve of D/sub c(t)/ and a paraboloid Q:z=x²+y²-d² into the xy-plane.

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

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.333-349
• /
• 2019

We give explicitly an average value formula under the multiplication-by-2 map for the x-coordinates of the 2-division points D on the Jacobian variety J(C) of a hyperelliptic curve C with genus g if $2D{\equiv}2P-2{\infty}$ (mod Pic(C)) for $P=(x_P,y_P){\in}C$ with $y_P{\neq}0$. Moreover, if g = 2, we give a more explicit formula for D such that $2D{\equiv}P-{\infty}$ (mod Pic(C)).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.544-547
• /
• 2008

Navigation in 3D virtual environment(VE) is very difficult because the virtual environment is lack information than real 3D world. So navigation is import research subject in 3D VE. In this paper, we study tour path setting method using spline curve. The spline curve is augmented polynomial function. So the curve is differentiable. In particular, since the curves which are order of 2 and 3 are second order differentiable those are sufficiently smooth for using the computer graphics and CAD system.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1601-1606
• /
• 1991

We present an algorithm to approximate the Voronoi diagrams of 2D objects bounded by algebraic curves. Since the bisector curve for two algebraic curves of degree d can have a very high algebraic degree of 2 * d$^{4}$, it is very difficult to compute the exact algebraic curve equation of Voronoi edge. Thus, we suggest a simple polygonal approximation method. We first approximate each object by a simple polygon and compute a simplified polygonal Voronoi diagram for the approximating polygons. Finally, we approximate each monotone polygonal chain of Voronoi edges with Bezier cubic curve segments using least-square curve fitting.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.612-615
• /
• 2006

In this study, we compared and analyzed the floor impact noise insulation performance produced by the rating methods. The rating methods are using reversed A-weighting curve, A-weighted sound pressure levels(dB(A)). The results of this study are(1)dB(A) by the specified frequency is 0.5dB(A) at light weight and 2.5dB(A) at heavy weight upper than all pass dB(A)(2)the rating using reversed A-weighting curve is 5dB lower than dB(A)(3)the number of rating using reversed A-weighting curve mainly depends on impact noise pressure level of 63Hz in heavy weight but dB(A) does not.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.43.1-43.1
• /
• 2010

A novel method to characterize the topology of the early-universe intergalactic medium during the epoch of cosmic reionization is presented. The 21-cm radiation background from high redshift is analyzed through calculation of the 2-dimensional (2D) genus. The radiative transfer of hydrogen-ionizing photons and ionization-rate equations are calculated in a suite of numerical simulations under various input parameters. The 2D genus is calculated from the mock 21-cm images of high-redshift universe. We construct the 2D genus curve by varying the threshold differential brightness temperature, and compare this to the 2D genus curve of the underlying density field. We find that (1) the 2D genus curve reflects the evolutionary track of cosmic reionization and (2) the 2D genus curve can discriminate between certain reionization scenarios and thus indirectly probe the properties of radiation-sources. Choosing the right beam shape of a radio antenna is found crucial for this analysis. Square Kilometer Array (SKA) is found to be a suitable apparatus for this analysis in terms of sensitivity, even though some deterioration of the data for this purpose is unavoidable under the planned size of the antenna core.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.317-322
• /
• 2004

Productivity of shoe industry in Korea is still more excellent then that of China or Vietnam, But manufacturing technology and productive facility are underdevelopment in comparison advanced country. CAD/CAM system development, one of the most important technology, is totally nonexistent. specially, the automatic generation function and the grading function in shoe sole modeling are dependent of the foreign software. The CAD/CAM software only for shoe modeling is very expensive, so that it is going to weaken shoe industry of Korea. Therefore, We developed 3D gauge curve generation method using 2D NURBS curve in shoe sole modeling.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.97-103
• /
• 2017

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.