Computing the minimum distance between two Bézier curves

DOI10.1016/j.cam.2008.10.050zbMath1166.65006OpenAlexW2083567817MaRDI QIDQ1023338

Gang Xu, Linqiang Chen, Jun-Hai Yong, Jean-Claude Paul, Yigang Wang, Xiao-Diao Chen

Publication date: 11 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.050

zbMATH Keywords

numerical examplesminimum distanceBézier curvesweeping sphere clipping method

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

A competition flow method for computing medial axis transform ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Isogeometric shape optimization on triangulations ⋮ Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface ⋮ Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space

Cites Work

• Unnamed Item
• A counterexample on point inversion and projection for NURBS curve
• Point inversion and projection for nurbs curve and surface: control polygon approach
• Improved algorithms for the projection of points on NURBS curves and surfaces
• A second order algorithm for orthogonal projection onto curves and surfaces

This page was built for publication: Computing the minimum distance between two Bézier curves