Telikepalli Kavitha
Papers
1
Total Citations
12
H-Index
1
About
Telikepalli Kavitha is a distinguished theoretical computer scientist whose research spans computational geometry, graph theory, and combinatorial optimization. Her most-cited work, "An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon" (2002, 12 citations), addresses a fundamental problem in motion planning: finding curvature-constrained paths within polygonal environments. This contribution is particularly significant for robotics and autonomous navigation, where vehicles must follow smooth, physically feasible trajectories. Kavitha’s algorithm elegantly combines geometric reasoning with computational efficiency, offering a practical solution for generating convex, simple paths that respect turning radius constraints. Beyond this landmark paper, her broader research has advanced understanding in areas such as matching theory, stable matchings, and approximation algorithms. Her work is characterized by rigorous mathematical analysis and a focus on problems with real-world applications, from network design to resource allocation. Kavitha’s impact is reflected in the continued relevance of her geometric path-planning results, which remain a touchstone for researchers tackling curvature-constrained motion in complex environments. Her contributions exemplify how theoretical computer science can provide elegant, implementable solutions to challenging practical problems.
Research Focus
Key Achievements
Top Papers
- 1