loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on High Performance Computing
Computation of Penetration Measures for Convex Polygons and Polyhedra for Graphics Applications
Madras, India
December 17-December 20
ISBN: 0-8186-9194-8
ASCII Text
x 
 
K. Sridharan, "Computation of Penetration Measures for Convex Polygons and Polyhedra for Graphics Applications," High-Performance Computing, International Conference on, pp. 81, Fifth International Conference on High Performance Computing, 1998.
 
 
BibTex
x
 
@article{ 10.1109/HIPC.1998.737974,
author = {K. Sridharan},
title = {Computation of Penetration Measures for Convex Polygons and Polyhedra for Graphics Applications},
journal ={High-Performance Computing, International Conference on},
volume = {0},
year = {1998},
issn = {1094-7256},
pages = {81},
doi = {http://doi.ieeecomputersociety.org/10.1109/HIPC.1998.737974},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - High-Performance Computing, International Conference on
TI - Computation of Penetration Measures for Convex Polygons and Polyhedra for Graphics Applications
SN - 1094-7256
SP
EP
A1 - K. Sridharan,
PY - 1998
VL - 0
JA - High-Performance Computing, International Conference on
ER -
 
K. Sridharan, IIT-Guwahati
Algorithms to compute measures of penetration between convex polygonal objects in the plane and convex polyhedral objects in 3D 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.
Citation:
K. Sridharan, "Computation of Penetration Measures for Convex Polygons and Polyhedra for Graphics Applications," hipc, pp.81, Fifth International Conference on High Performance Computing, 1998
Usage of this product signifies your acceptance of the Terms of Use.