Ravi Janardan

Papers

Total Citations

H-Index

About

Ravi Janardan is a leading figure in computational geometry and its applications to robotics, communication networks, and VLSI design. His research centers on developing efficient algorithms for geometric intersection searching and spatial optimization, with a particular focus on problems involving constrained pathways and mobile systems. Janardan’s seminal work on “widest-corridor problems” (1994, 19 citations) introduced the concept of a *k*-dense corridor—an open region bounded by two parallel lines containing exactly *k* points from a set—and provided foundational algorithms for robot motion planning in cluttered environments. This work has been widely cited for its elegant geometric insights and practical relevance. He later extended these ideas to dynamic communication infrastructures, as seen in his influential paper “Building a Communication Bridge With Mobile Hubs” (2011, 11 citations), which proposed using mobile robots as on-demand relays in disaster scenarios where fixed networks fail. More recently, his survey on generalized (or colored) intersection searching (2018, 8 citations) has become a key reference for researchers tackling multi-criteria geometric queries across diverse fields. With a career spanning over three decades, Janardan’s contributions continue to shape algorithmic design for real-world spatial problems, earning him recognition as a pioneer in bridging theoretical geometry with applied robotics and network planning.