文章基本信息

标题：Efficient Distance Computation Between Natural Quadrics
本地全文：下载
作者：Mustafa S. Fawad ; Mustafa Atika
期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2006
卷号：2
期号：2
页码：1-4
出版社：Journal of Theoretical and Applied
摘要：The idea of our work is on one of the basic problems, namely the fast calculation of the distance between two objects. We haveimplemented an enhanced version of the shortest distance routine on the basis of mathematical equations, which allows thetracking of the distance between a pair of conics and quadrics in time that to be bounded by a constant is expected. Experimentalresults confirm this result, at least for moderate shortest distance calculation, and suggest that the enhanced algorithm might alsocome in handy. Computing the distance between two objects is a common problem, using the mathematical model of twoobjects, we find the point on each object such that the distance between the objects is minimized. To do this we took care ofefficient computing, which is possible with simplifying the polynomials and their relative coefficients. Effectiveness ofcomputing algorithms and executing time are also analyzed. We tested the calculation on various natural quadrics. The graphicspart is implemented in openGL and QT library is used for user interface. The execution time is calculated by running thedistance calculation routines 10,000,000 times.
关键词：Polynomial degree ; equations ; Lagrange formulation ; real roots