Title :
Computation of penetration measures for convex polygons and polyhedra for graphics applications
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Guwahati, India
Abstract :
Algorithms to compute measures of penetration between convex polygonal objects in ℜ2 and convex polyhedral objects in ℜ3 are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed
Keywords :
computational complexity; computational geometry; computer graphics; parallel algorithms; algorithm parallelization; asymptotic complexity; convex polygonal objects; convex polygons; convex polyhedral objects; graphics applications; penetration measures; polyhedra; single processor machine; Aerospace simulation; Application software; Computational modeling; Computer graphics; Computer science; Drugs; Electrical capacitance tomography; Euclidean distance; Strontium; Vehicles;
Conference_Titel :
High Performance Computing, 1998. HIPC '98. 5th International Conference On
Conference_Location :
Madras
Print_ISBN :
0-8186-9194-8
DOI :
10.1109/HIPC.1998.737974
