Location of Repository

Computing the minimum distance between two Bézier curves. (English summary) J. Comput. Appl. Math. 229 (2009), no. 1, 294–301. Summary: “A sweeping sphere clipping method is presented for computing the minimum distance between two Bézier curves. The sweeping sphere is constructed by rolling a sphere with its center point along a curve. The initial radius of the sweeping sphere can be set as the minimum distance between an end point and the other curve. The nearest point on a curve must be contained in the sweeping sphere along the other curve, and all of the parts outside the sweeping sphere can be eliminated. A simple sufficient condition when the nearest point is one of the two end points of a curve is provided, which turns the curve/curve case into a point/curve case and leads to higher efficiency. Examples are shown to illustrate efficiency and robustness of the new method.

Topics:
Wang, Yigang (PRC-HZDZ, Xu, Gang [Xu, Gang 3] (PRC-HZDZ

Year: 2000

OAI identifier:
oai:CiteSeerX.psu:10.1.1.352.8023

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.