文章基本信息

标题：Efficient Distance Computation between Natural Quadrics
本地全文：下载
作者：Syed Fawad Mustafa Atika Mustafa
期刊名称：Computer Sciences and Telecommunications
印刷版ISSN：1512-1232
出版年度：2006
期号：02
页码：190-194
出版社：Internet Academy
摘要：The idea of our work is on one of the basic problems, namely the fast calculation of the distance between two objects. We have implemented an enhanced version of the shortest distance routine on the basis of mathematical equations, which allows the tracking of the distance between a pair of conics and quadrics in time that to be bounded by a constant is expected. Experimental results confirm this result, at least for moderate shortest distance calculation, and suggest that the enhanced algorithm might also come in handy. Computing the distance between two objects is a common problem, using the mathematical model of two objects, we find the point on each object such that the distance between the objects is minimized. To do this we took care of efficient computing, which is possible with simplifying the polynomials and their relative coefficients. Effectiveness of computing algorithms and executing time are also analyzed. We tested the calculation on various natural quadrics. The graphics part is implemented in openGL and QT library is used for user interface. The execution time is calculated by running the distance calculation routines 10,000,000 times.
关键词：Polynomial degree, equations, Lagrange formulation, real roots