Minimum distance between a canal surface and a simple surface
Identifieur interne : 006F96 ( Main/Curation ); précédent : 006F95; suivant : 006F97Minimum distance between a canal surface and a simple surface
Auteurs : Ku-Jin Kim [Corée du Sud]Source :
- Computer-aided design [ 0010-4485 ] ; 2003.
Abstract
The computation of the minimum distance between two objects is an important problem in the applications such as haptic rendering, CAD/CAM, NC verification, robotics and computer graphics. This paper presents a method to compute the minimum distance between a canal surface and a simple surface (i.e a plane, a natural quadric, or a torus) by finding roots of a function of a single parameter. We utilize the fact that the normals at the closest points between two surfaces are collinear. Given the spine curve C(t), tmin ≤ t < tmax' and the radius function r(t) for a canal surface, a point on the spine curve C(t*) uniquely determines a characteristic circle K(t*) on the surface. Normals to the canal surface at points on K(t*) form a cone with a vertex C(t*) and an axis which is parallel to C'(t*). Then we construct a function of t which expresses the condition that the perpendicular from C(t) to a given simple surface is embedded in the cone of normals to the canal surface at points on K(t). By solving this equation, we find characteristic circles which contain the points of locally minimum distance from the simple surface. Based on these circles, we can compute the minimum distance between given surfaces.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001157
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000354
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000E42
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :007474
Links to Exploration step
Pascal:03-0340511Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Minimum distance between a canal surface and a simple surface</title><author><name sortKey="Kim, Ku Jin" sort="Kim, Ku Jin" uniqKey="Kim K" first="Ku-Jin" last="Kim">Ku-Jin Kim</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>The Graduate School of Information and Communication, Ajou University</s1><s2>Suwon 442-749</s2><s3>KOR</s3><sZ>1 aut.</sZ></inist:fA14><country>Corée du Sud</country><wicri:noRegion>Suwon 442-749</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0340511</idno><date when="2003">2003</date><idno type="stanalyst">PASCAL 03-0340511 INIST</idno><idno type="RBID">Pascal:03-0340511</idno><idno type="wicri:Area/PascalFrancis/Corpus">001157</idno><idno type="wicri:Area/PascalFrancis/Curation">000354</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000E42</idno><idno type="wicri:doubleKey">0010-4485:2003:Kim K:minimum:distance:between</idno><idno type="wicri:Area/Main/Merge">007474</idno><idno type="wicri:Area/Main/Curation">006F96</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Minimum distance between a canal surface and a simple surface</title><author><name sortKey="Kim, Ku Jin" sort="Kim, Ku Jin" uniqKey="Kim K" first="Ku-Jin" last="Kim">Ku-Jin Kim</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>The Graduate School of Information and Communication, Ajou University</s1><s2>Suwon 442-749</s2><s3>KOR</s3><sZ>1 aut.</sZ></inist:fA14><country>Corée du Sud</country><wicri:noRegion>Suwon 442-749</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Computer-aided design</title><title level="j" type="abbreviated">Comput.-aided des.</title><idno type="ISSN">0010-4485</idno><imprint><date when="2003">2003</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer-aided design</title><title level="j" type="abbreviated">Comput.-aided des.</title><idno type="ISSN">0010-4485</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The computation of the minimum distance between two objects is an important problem in the applications such as haptic rendering, CAD/CAM, NC verification, robotics and computer graphics. This paper presents a method to compute the minimum distance between a canal surface and a simple surface (i.e a plane, a natural quadric, or a torus) by finding roots of a function of a single parameter. We utilize the fact that the normals at the closest points between two surfaces are collinear. Given the spine curve C(t), t<sub>min</sub> ≤ t < t<sub>max'</sub> and the radius function r(t) for a canal surface, a point on the spine curve C(t<sub>*</sub>) uniquely determines a characteristic circle K(t<sub>*</sub>) on the surface. Normals to the canal surface at points on K(t<sub>*</sub>) form a cone with a vertex C(t<sub>*</sub>) and an axis which is parallel to C'(t<sub>*</sub>). Then we construct a function of t which expresses the condition that the perpendicular from C(t) to a given simple surface is embedded in the cone of normals to the canal surface at points on K(t). By solving this equation, we find characteristic circles which contain the points of locally minimum distance from the simple surface. Based on these circles, we can compute the minimum distance between given surfaces.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/HapticV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006F96 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 006F96 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= HapticV1
|flux= Main
|étape= Curation
|type= RBID
|clé= Pascal:03-0340511
|texte= Minimum distance between a canal surface and a simple surface
}}
| This area was generated with Dilib version V0.6.23. |  |