Short Communication to SMI 2011: Computation of the minimum distance between two Bézier curves/surfaces

Authors:
Jung-Woo Chang;Yi-King Choi;Myung-Soo Kim;Wenping Wang
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;School of Computer Science and Engineering, Seoul National University, Republic of Korea;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
Computers and Graphics
Year:
2011

Citing 10
Cited 0

The NURBS book

The NURBS book
OBBTree: a hierarchical structure for rapid interference detection

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A fast and robust GJK implementation for collision detection of convex objects

Journal of Graphics Tools
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
Collision Detection for Interactive Graphics Applications

IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs

IEEE Transactions on Visualization and Computer Graphics
Efficient Distance Computation for Quadratic Curves and Surfaces

GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Computing the minimum distance between two Bézier curves

Journal of Computational and Applied Mathematics
Hausdorff and minimal distances between parametric freeforms in R2and R3

GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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