• Korean Journal of Computational Design and Engineering
• /
• v.5 no.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.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.975-978
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.8 s.173
• /
• pp.76-83
• /
• 2005

In this study a general method for computing offsets of free form curves is presented. In the method arbitrary free form curve is approximated with point series considering required tolerance. The point series are offset precisely using the normal vectors computed at each point and loop removal is carried out by the newly suggested algorithm. The resulting offset points are transformed to lines and arcs using the biarc approximation method. Tangent vectors for approximation of discrete points data are calculated by traditional local interpolation scheme. In order to show the validity and generality of the proposed method , various of offsettings are carried our for the base curves with complex shapes.

• Journal of Power System Engineering
• /
• v.5 no.2
• /
• pp.43-49
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

• Asia-Pacific Journal of Business
• /
• v.9 no.2
• /
• pp.1-13
• /
• 2018

Physics simulation is an important part of many interactive 2D applications and collision detection and response is key component of this simulation. While methods for reducing the number of collision tests that need to be performed has been well researched, methods for performing the final checks with collision primitives have seen little recent development. This paper presents a new collision primitive, the n-arc, constructed from piecewise circular curves or biarcs. An algorithm for performing a collision check between these primitives is presented and compared to a convex polygon primitive. The n-arc is shown to exhibit similar, though slightly slower, performance to a polygon when no collision occurs, but is considerably faster when a collision does occur. The goodness of fit of the new primitive is also compared to a polygon. While the n-arc often gives a looser fit in terms of area, the continuous tangents of the n-arcs makes them a good choice for organic, soft or curved surfaces.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.55-60
• /
• 2010

Quadratic B$\acute{e}$zier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic B$\acute{e}$zier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing $G^1$ quadratic B$\acute{e}$zier curves satisfying given endpoint (positions and arbitrary unit tangent vectors) conditions. Examples are given to illustrate the new solution and to perform comparison between the $G^1$ quadratic B$\acute{e}$zier cures and other curve schemes such as the composite geometric Hermite curves and the biarcs.

• Journal of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.805-823
• /
• 2019

We introduce polynomial PH-MPH transitive mappings which transform planar PH curves to MPH curves in ${\mathbb{R}}^{2,1}$, and prove that parameterizations of Enneper surfaces of the 1st and the 2nd kind and conjugates of Enneper surfaces of the 2nd kind are PH-MPH transitive. We show how to solve $C^1$ Hermite interpolation problems in ${\mathbb{R}}^{2,1}$, for an admissible $C^1$ Hermite data-set, by using the parametrization of Enneper surfaces of the 1st kind. We also show that we can obtain interpolants for at least some inadmissible data-sets by using MPH biarcs on Enneper surfaces of the 1st kind.