The NURBS book
An interactive tool for placing curved surfaces without interpenetration
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
Geometric constraint solver using multivariate rational spline functions
Proceedings of the sixth ACM symposium on Solid modeling and applications
Skeletal Methods of Shape Manipulation
SMI '99 Proceedings of the International Conference on Shape Modeling and Applications
M-Reps: A New Object Representation for Graphics
M-Reps: A New Object Representation for Graphics
Collision Detection
Haptic rendering of surface-to-surface sculpted model interaction
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Oriented bounding surfaces with at most six common normals
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Global optimization of tool path for five-axis flank milling with a conical cutter
Computer-Aided Design
Computing the distance between canal surfaces
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Distance computation for canal surfaces using cone-sphere bounding volumes
Computer Aided Geometric Design
| Hi-index | 0.00 |
We present an efficient and robust approach for computing the minimum distance between two sphere-swept surfaces. As examples of sphere-swept surfaces, we consider canal surfaces and bivariate sphere-swept surfaces. For computing the minimum distance between two parametric surfaces, a simple technique is to find the two closest points from the given surfaces using the normal vector information. We suggest a novel approach that efficiently computes the minimum distance between two sphere-swept surfaces by treating each surface as a family of spheres. Rather than computing the complicated normal vectors for given surfaces, our method solves the problem by computing the minimum distance between two moving spheres. We prove that the minimum distance between two sphere-swept surfaces is identical to that between two moving spheres. Experimental results of minimum distance computation are given. We also reproduce the result of Kim [Kim K-J. Minimum distance between a canal surface and a simple surface. Computer-Aided Design 2003;35:871-9] based on the suggested approach.