Papers
2
Total Citations
53
H-Index
2
About
D. Bhagavathi is a computer scientist whose research centers on parallel algorithms and computational geometry, with a particular focus on enhancing the efficiency of mesh-based architectures. His major contributions lie in developing time-optimal solutions for fundamental problems on meshes with multiple broadcasting, a parallel computing model that allows rapid data sharing across processing elements. In his most cited work, "A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications" (1994, 30 citations), Bhagavathi introduced a novel search method that achieves optimal time complexity, with applications to sorting and computational geometry. He further advanced the field with "Time-optimal visibility-related algorithms on meshes with multiple broadcasting" (1995, 23 citations), where he tackled the classic visibility problem—determining which portions of objects in a plane are visible from a given viewpoint. This work is central to computer graphics and geographic information systems. Bhagavathi’s algorithms are notable for their theoretical rigor and practical relevance, offering efficient parallel solutions to problems that are computationally intensive on sequential machines. His research continues to influence the design of high-performance computing systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2