Tsunehiko Kameda
Papers
2
Total Citations
4
H-Index
2
About
Tsunehiko Kameda is a leading figure in computational geometry and robotics, whose work focuses on the theoretical foundations of search and surveillance. His research addresses fundamental problems in visibility, motion planning, and pursuit-evasion, particularly in polygonal environments. Kameda’s major contributions include developing efficient algorithms for boundary-based search, such as his O(n)-time method for testing whether a polygonal area can be effectively surveilled by a mobile searcher equipped with a flashlight. He also pioneered the study of minimum-distance scheduling for boundary searchers, solving complex optimization problems that arise when an agent must illuminate a moving intruder while constrained to the polygon’s perimeter. Though his most-cited works have garnered modest citation counts (2 each), their impact lies in their rigorous theoretical framing and algorithmic elegance, providing foundational tools for later advances in robotic surveillance and autonomous monitoring. Kameda’s work is notable for its clarity and depth, making it essential reading for students and researchers interested in the intersection of geometry, algorithms, and robotics.
Research Focus
Key Achievements
Top Papers
- 1
- 2