Teren Gum
Papers
1
Total Citations
22
H-Index
1
About
Teren Gum is a foundational figure in computational geometry, best known for pioneering work on visibility problems within simple polygons. His 1986 paper, "Visibility between two edges of a simple polygon," established a core algorithmic framework for determining whether two edges of a polygon can see each other—a problem with lasting implications for computer graphics, robotics, and geographic information systems. Though the paper has accrued 22 citations, its influence extends far beyond this count, as it laid the groundwork for subsequent research on polygon visibility, art gallery problems, and motion planning. Gum’s contributions are particularly notable for their clarity and elegance, offering efficient solutions that remain relevant decades later. His work is frequently cited in studies on visibility graphs and shortest path algorithms, underscoring its enduring impact on the field. For students and researchers exploring geometric algorithms, Gum’s research exemplifies how a focused, well-defined problem can yield insights that resonate across multiple domains.
Research Focus
Key Achievements
Top Papers
- 1Visibility between two edges of a simple polygon22 citations · 1986