Minimum distance between two sphere-swept surfaces

Kwanhee Lee, Jun Kyung Seong, Ku Jin Kim, Sung Je Hong

Research output: Contribution to journalArticle

17 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)452-459
Number of pages8
JournalCAD Computer Aided Design
Volume39
Issue number6
DOIs
Publication statusPublished - 2007 Jun 1
Externally publishedYes

Fingerprint

Minimum Distance
Sweep
Normal vector
Computing
Canals
Parametric Surfaces
Computer-aided Design
Computer aided design

Keywords

  • Bivariate sphere-swept surface
  • Canal surface
  • Distance
  • Sphere geometry

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering
  • Geometry and Topology

Cite this

Minimum distance between two sphere-swept surfaces. / Lee, Kwanhee; Seong, Jun Kyung; Kim, Ku Jin; Hong, Sung Je.

In: CAD Computer Aided Design, Vol. 39, No. 6, 01.06.2007, p. 452-459.

Research output: Contribution to journalArticle

Lee, Kwanhee ; Seong, Jun Kyung ; Kim, Ku Jin ; Hong, Sung Je. / Minimum distance between two sphere-swept surfaces. In: CAD Computer Aided Design. 2007 ; Vol. 39, No. 6. pp. 452-459.
@article{2ceb87a9979448a4b9e7985e3faf0fe4,
title = "Minimum distance between two sphere-swept surfaces",
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.",
keywords = "Bivariate sphere-swept surface, Canal surface, Distance, Sphere geometry",
author = "Kwanhee Lee and Seong, {Jun Kyung} and Kim, {Ku Jin} and Hong, {Sung Je}",
year = "2007",
month = "6",
day = "1",
doi = "10.1016/j.cad.2007.01.002",
language = "English",
volume = "39",
pages = "452--459",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - Minimum distance between two sphere-swept surfaces

AU - Lee, Kwanhee

AU - Seong, Jun Kyung

AU - Kim, Ku Jin

AU - Hong, Sung Je

PY - 2007/6/1

Y1 - 2007/6/1

N2 - 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.

AB - 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.

KW - Bivariate sphere-swept surface

KW - Canal surface

KW - Distance

KW - Sphere geometry

UR - http://www.scopus.com/inward/record.url?scp=34248530671&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34248530671&partnerID=8YFLogxK

U2 - 10.1016/j.cad.2007.01.002

DO - 10.1016/j.cad.2007.01.002

M3 - Article

VL - 39

SP - 452

EP - 459

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 6

ER -