A cocktail algorithm for planar Bezier curve intersections

Cited 9 time in webofscience Cited 12 time in scopus
  • Hit : 553
  • Download : 0
Presented in this paper is a new intersection algorithm between planar Bezier 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 Bezier curve segments according to the shape characteristics of the curve. Then, the rational quadratic Bezier 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. (C) 1999 Elsevier Science Ltd. All rights reserved.
Publisher
ELSEVIER SCI LTD
Issue Date
1998-11
Language
English
Article Type
Article
Keywords

CUBIC CURVES

Citation

COMPUTER-AIDED DESIGN, v.30, no.13, pp.1047 - 1051

ISSN
0010-4485
DOI
10.1016/S0010-4485(98)00052-9
URI
http://hdl.handle.net/10203/67845
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0