Geometric modeling
The NURBS book
Geometric constraint solver using multivariate rational spline functions
Proceedings of the sixth ACM symposium on Solid modeling and applications
Shape Interrogation for Computer Aided Design and Manufacturing
Shape Interrogation for Computer Aided Design and Manufacturing
Point inversion and projection for NURBS curve and surface: control polygon approach
Computer Aided Geometric Design
A second order algorithm for orthogonal projection onto curves and surfaces
Computer Aided Geometric Design
Improved algorithms for the projection of points on NURBS curves and surfaces
Computer Aided Geometric Design
A counterexample on point inversion and projection for NURBS curve
Computer Aided Geometric Design
Improved Algebraic Algorithm on Point projection for Béziercurves
IMSCCS '07 Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences
TAR based shape features in unconstrained handwritten digit recognition
WSEAS Transactions on Computers
Precise Hausdorff distance computation between polygonal meshes
Computer Aided Geometric Design
Computing the Hausdorff distance between two B-spline curves
Computer-Aided Design
Efficient point projection to freeform curves and surfaces
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Implicitization of curves and (hyper)surfaces using predicted support
Theoretical Computer Science
| Hi-index | 7.29 |
A sweeping sphere clipping method is presented for computing the minimum distance between two Bezier 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.