Curve intersection using Bézier clipping (Q753381): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Thomas W. Sederberg / rank | |||
| Property / author | |||
| Property / author: Tomoyuki Nishita / rank | |||
| Property / author | |||
| Property / author: Thomas W. Sederberg / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Tomoyuki Nishita / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Curve intersection using Bézier clipping |
scientific article |
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
