Get all the updates for this publication
Other
Computation of penetration measures for convex polygons and polyhedra for graphics applicationsPublished in IEEE Computer Society
1998
Pages: 81 - 87
Algorithms to compute measures of penetration between convex polygonal objects in Rfr/2 and convex polyhedral objects in Rfr/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. © 1998 IEEE.
Topics: Polyhedron (56)%56% related to the paper, Computational geometry (55)%55% related to the paper, Polygon (51)%51% related to the paper and Regular polygon (51)%51% related to the paper
View more info for "Computation of penetration measures for convex polygons and polyhedra for graphics applications"
Content may be subject to copyright.
About the journal
| Journal | Data powered by TypesetProceedings - Symposium on Computer Architecture and High Performance Computing |
|---|---|
| Publisher | Data powered by TypesetIEEE Computer Society |
| ISSN | 15506533 |
| Open Access | No |
Authors (1)
Krishnamurthy Sridharan- A parallel algorithm, architecture and FPGA realization for high speed determination of the complete visibility graph for convex objects
- A comparative study on the performance of differently treated plain carbon steel gears
- Carbon nanotube FET-based low-delay and low-power multi-digit adder designs
- Hardware-efficient prediction-correction-based generalized-voronoi-diagram construction and FPGA implementation
