Computation of the minimum distance between two Bézier curves/surfaces

We present an efficient and robust method based on the culling approach for computing the minimum distance between two Bézier curves or Bézier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision.

Graphical abstractFigure optionsDownload full-size imageDownload high-quality image (31 K)Download as PowerPoint slideHighlights► Our algorithm computes the minimum distance between two Bézier curves/surfaces. ► For curve case, our algorithm is faster than the existing algorithms by about 21–93%. ► For surface case, our algorithm is faster than the binary subdivision by about 18–73%.