Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PG

2002

IEEE

2002

IEEE

We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-surface intersection problem, which leads to lowdimensional root ﬁnding in a system of equations. This approach produces an efﬁcient algorithm for computing the distance between two ellipsoids, where the problem is reduced to ﬁnding a speciﬁc solution in a system of two equations in two variables. Similar algorithms can be designed for computing the distance between an ellipsoid and a simple surface (such as cylinder, cone, or torus). In an experimental implementation (on a 500 MHz Windows PC), the distance between two ellipsoids was computed in less than 0.3 msec on average; and the distance between an ellipsoid and a simple convex surface was computed in less than 0.15 msec on average.

Related Content

Added |
15 Jul 2010 |

Updated |
15 Jul 2010 |

Type |
Conference |

Year |
2002 |

Where |
PG |

Authors |
Kyung-Ah Sohn, Bert Jüttler, Myung-Soo Kim, Wenping Wang |

Comments (0)