Title :
A Uniform Method for Computing the Distance between Ellipsoids
Author :
Ping, Zhou Zhi ; Gan Sheng Ke
Author_Institution :
Sch. of Comput., Nanchang HangKong Univ., Nanchang, China
Abstract :
In this paper, a uniform method is presented for computing the minimum translational distance (MTD) between a pair of ellipsoids. This article deduces a necessary and sufficient condition of the witness point-pair which achieve MTD value and reliable criteria for determining their spatial relation. Experimental results show the algorithm converge after a few iteration whether two objects overlap or not and perform better than other algorithms.
Keywords :
commerce; geometry; nonlinear programming; MTD value; Minkowski difference; electronic commerce; ellipsoid; minimum translational distance; nonlinear programming; Computational modeling; Computer security; Eigenvalues and eigenfunctions; Electronic commerce; Ellipsoids; Matrix decomposition; Spline; Sufficient conditions; Surface reconstruction; Surface topography; Minkowski difference; minimum translational distance; nonlinear programming;
Conference_Titel :
Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on
Conference_Location :
Nanchang
Print_ISBN :
978-0-7695-3643-9
DOI :
10.1109/ISECS.2009.238
