A cocktail algorithm for planar Bézier curve intersections

Document Type

Article

Publication Date

1-1-1998

Abstract

Presented in this paper is a new intersection algorithm between planar Bézier curves. The algorithm, named the cocktail algorithm, mixes and matches the merits of existing intersection algorithms appropriately. In the proposed approach, curves are approximated by a number of rational quadratic Bézier curve segments according to the shape characteristics of the curve. Then, the rational quadratic Bézier curve approximations are intersected using the implicitization method to produce the seeds of the numerical process. Experimental results reveal that the performance of the cocktail algorithm is superior to others for the curves with degrees higher than cubic. For cubic curves, however, the cocktail algorithm is slightly slower than the implicitization method with a hard coded resultant, but faster than others. © 1999 Elsevier Science Ltd. All rights reserved.

Identifier

0032203895 (Scopus)

Publication Title

CAD Computer Aided Design

External Full Text Location

https://doi.org/10.1016/S0010-4485(98)00052-9

ISSN

00104485

First Page

1047

Last Page

1051

Issue

13

Volume

30

Grant

961-1007-062-2

Fund Ref

Korea Science and Engineering Foundation

This document is currently not available here.

Share

COinS