Curve intersection using Bézier clipping (Q753381)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4180631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Curve intersection using Bézier clipping |
scientific article; zbMATH DE number 4180631 |
Statements
Curve intersection using Bézier clipping (English)
0 references
1990
0 references
An algorithm for computing the points at which two planar Bézier curves intersect, and also an algorithm for robustly and quickly computing points of tangency between two curves are developed by a new technique, the so-called Bézier clipping. This strategy uses the convex hull property of Bézier curves to identify regions which do not include a part of the solution. By iteratively clipping away such regions, the solution is obtained by a quadratic convergence rate.
0 references
curve intersection
0 references
algorithm
0 references
Bézier curves
0 references
points of tangency
0 references
Bézier clipping
0 references
convex hull property
0 references
quadratic convergence rate
0 references
0.8551352024078369
0 references
0.8060518503189087
0 references
0.8053014278411865
0 references
0.8019040822982788
0 references
0.7967432141304016
0 references
