Tatsuya Hayashi
Papers
1
Total Citations
5
H-Index
1
About
Tatsuya Hayashi is a researcher in parallel algorithms and computational geometry, with a focus on reconfigurable mesh architectures. His most cited work introduces an algorithm that computes the convex hull of sorted points in the plane in O((log log n)²) time on reconfigurable meshes—a significant improvement over prior approaches. This contribution addresses a fundamental problem with broad applications in image processing, pattern recognition, cellular network design, and robotics. By demonstrating how to leverage the reconfigurable mesh’s unique ability to dynamically alter its interconnection pattern, Hayashi’s algorithm achieves near-optimal speed for sorted input, offering both theoretical elegance and practical relevance. Though his citation count is modest, the work stands out for its technical depth and the clarity with which it tackles a classic geometric challenge. Hayashi’s research underscores the enduring value of efficient parallel computation in solving real-world spatial problems, making his contributions a useful reference for students and researchers exploring high-performance computing and geometry.
Research Focus
Key Achievements
Top Papers
- 1