Minimum distance between two sphere-swept surfaces
SCIE
SCOPUS
- Title
- Minimum distance between two sphere-swept surfaces
- Authors
- Lee, K; Seong, JK; Kim, K; Hong, SJ
- Date Issued
- 2007-06
- Publisher
- ELSEVIER SCI LTD
- Abstract
- 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. (C) 2007 Elsevier Ltd. All rights reserved.
- Keywords
- distance; canal surface; bivariate sphere-swept surface; sphere geometry; COLLISION DETECTION
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/23305
- DOI
- 10.1016/J.CAD.2007.0
- ISSN
- 0010-4485
- Article Type
- Article
- Citation
- COMPUTER-AIDED DESIGN, vol. 39, no. 6, page. 452 - 459, 2007-06
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.