David Avis

Papers

Total Citations

H-Index

About

David Avis is a leading figure in computational geometry and optimization, whose work has shaped how we understand geometric algorithms and their applications. His research spans visibility problems, robot localization, and linear programming, with a particular focus on the theoretical foundations of geometric computation. Avis is best known for his contributions to the analysis of polygon visibility, including his seminal 1986 paper on visibility between two edges of a simple polygon, which laid groundwork for efficient algorithms in computer graphics and robotics. His 1990 study on locating a robot using angle measurements—cited 29 times—demonstrated how geometric reasoning can solve practical localization challenges, influencing subsequent work in autonomous systems. Beyond these highlights, Avis has made enduring contributions to the theory of linear programming and convex polytopes, including the development of the reverse search algorithm, a landmark method for enumerating vertices of polytopes. His work has garnered over 2,000 citations across his career, reflecting its lasting impact on both theoretical computer science and engineering. Avis’s ability to bridge abstract geometry with real-world problems makes his research essential reading for students exploring computational geometry, robotics, and optimization.