Patrick Ryan Morin

Papers

Total Citations

H-Index

About

Patrick Ryan Morin is a leading figure in computational geometry and graph theory, with a particular focus on algorithms for routing, data structures, and discrete mathematics. His most-cited work, the 2001 thesis "Online routing in geometric graphs" (39 citations), tackles the fundamental challenge of navigating networks using only local information—a problem with direct applications in robotics, mobile networks, and distributed computing. This research laid critical groundwork for understanding how to find paths in geometric graphs without global knowledge, influencing subsequent work in sensor networks and autonomous systems. Beyond routing, Morin has made substantial contributions to the analysis of randomized algorithms, binary search trees, and the combinatorial structure of geometric graphs. His work is characterized by elegant theoretical proofs and practical algorithmic insights, earning him a reputation for bridging abstract theory with real-world computational problems. With a career spanning decades of influential publications, Morin continues to shape the field through both his research and mentorship, inspiring a new generation of computer scientists to explore the intersection of geometry, algorithms, and network theory.