Code covered by the BSD License
by Roberto Olmi
30 Jul 2008 (Updated 04 Sep 2008)
Computes the minimal distace between two segments
| Watch this File
The algorithm computes the minimal distace between two segments. It also manage the case of parallel segments and null length segments. The algorith is inspired by Franz J. Vesely at http://homepage.univie.ac.at/Franz.Vesely/notes/hard_sticks/hst/hst.html
Some bugs have been fixed
Added keywords for facilitate searches
Some bugs found using the function has been fixed.
Contact us at files@mathworks.com