An efficient algorithm to compute the distance between two line segments
Source
The Arabian Journal for Science and Engineering. Section B, Engineering
Issue
Vol. 23, Issue 2B (31 Oct. 1998), pp.243-251, 9 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
1998-10-31
Country of Publication
Saudi Arabia
No. of Pages
9
Main Subjects
Engineering & Technology Sciences (Multidisciplinary)
Abstract EN
We present a fast algorithm for computing the shortest distance between two line segments in three-dimensional (3D) space.
A Karush-Kuhn-Tucker (KKT) formulation is used to derive the algebraic equations at optimality.
We show that these equations can be solved in closed-forms.
The proposed algorithm gives not only the shortest distance, but also the coordinate of the optimal points.
It can be applied on segments of different or equal lengths defined in 2D or 3D spaces.
The computation of the shortest distance requires at most 18 multiplications or divisions and 14 additions.
Extensive simulation tests show that the average computation time of the algorithm is about 8.46 xlO-4 second on a computer running under 33 MHz.
American Psychological Association (APA)
al-Muhammad, H. A.. 1998. An efficient algorithm to compute the distance between two line segments. The Arabian Journal for Science and Engineering. Section B, Engineering،Vol. 23, no. 2B, pp.243-251.
https://search.emarefa.net/detail/BIM-389931
Modern Language Association (MLA)
al-Muhammad, H. A.. An efficient algorithm to compute the distance between two line segments. The Arabian Journal for Science and Engineering. Section B, Engineering Vol. 23, no. 2B (Oct. 1998), pp.243-251.
https://search.emarefa.net/detail/BIM-389931
American Medical Association (AMA)
al-Muhammad, H. A.. An efficient algorithm to compute the distance between two line segments. The Arabian Journal for Science and Engineering. Section B, Engineering. 1998. Vol. 23, no. 2B, pp.243-251.
https://search.emarefa.net/detail/BIM-389931
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 251
Record ID
BIM-389931