Joerg Sack

Papers

Total Citations

H-Index

About

Joerg Sack is a leading figure in computational geometry and graph algorithms, with a particular focus on routing in geometric graphs. His most-cited work, the 2001 thesis "Online routing in geometric graphs" (39 citations), tackles a fundamental challenge in robotics, distributed computing, and mobile networks: finding a path from source to destination using only local information. This research laid critical groundwork for understanding how to navigate networks where global knowledge is unavailable, a problem that arises in everyday scenarios from GPS navigation to wireless sensor networks. Sack's contributions extend to the design and analysis of algorithms for geometric data structures, including planar subdivisions and proximity graphs. His work is characterized by rigorous theoretical foundations applied to practical problems in spatial computing. With a career spanning decades, Sack has also made notable contributions to the study of Voronoi diagrams and their applications. His research continues to influence fields ranging from autonomous robotics to network routing protocols, making him a respected voice in the computational geometry community.