DocumentCode
2452837
Title
Computation of penetration measures for convex polygons and polyhedra for graphics applications
Author
Sridharan, K.
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Guwahati, India
fYear
1998
fDate
17-20 Dec 1998
Firstpage
81
Lastpage
87
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;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing, 1998. HIPC '98. 5th International Conference On
Conference_Location
Madras
Print_ISBN
0-8186-9194-8
Type
conf
DOI
10.1109/HIPC.1998.737974
Filename
737974
Link To Document