返回
Minimum distance between two sphere-swept surfaces
DOI:10.1016/j.cad.2007.01.002.png)
摘要
En 中文
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.
Keyword:
distance
canal surface
bivariate sphere-swept surface
sphere geometry
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.2K
被引数:
6.4K
机构
暂无机构信息
引用论文
Efficacy of nonviral gene transfer of human hepatocyte growth factor (HGF) against ischemic-reperfusion nerve injury in rats
PLOS ONE
IF0
Synthesis and characterization of PVP-capped ZnO particles and its blend with poly(3-hexylthiophene) for hybrid solar cells applicationPVP包覆ZnO粒子的合成与表征及其与聚(3-己基噻吩)共混用于杂化太阳能电池应用
Spectral forecast: A general purpose prediction model as an alternative to classical neural networks

