Sariel Har-Peled

Papers

Total Citations

H-Index

About

Sariel Har-Peled is a leading figure in computational geometry, whose work bridges theoretical foundations and practical algorithmic design. His research primarily focuses on geometric optimization, approximation algorithms, and the complexity of geometric arrangements. Har-Peled is renowned for pioneering efficient solutions to problems involving Minkowski sums and configuration spaces, as demonstrated in his early work on the complexity of a single face of a Minkowski sum (18 citations), which provided critical insights into the combinatorial structure of free regions for robot motion planning. This foundational contribution has influenced subsequent research in robotics and geometric modeling. He also made significant strides in human-computer interaction and distributed systems, notably with his paper on efficient algorithms for shared camera control (20 citations), where he developed geometric optimization techniques to coordinate multiple users controlling a robotic webcam, showcasing the real-world applicability of his theoretical work. With a career marked by high-impact publications, Har-Peled’s work has garnered substantial recognition, shaping how researchers approach geometric data structures and approximation methods. His ability to distill complex geometric problems into elegant, efficient algorithms continues to inspire students and researchers in computer science, solidifying his legacy as a transformative thinker in the field.