Otfried Schwarzkopf

Pohang University of Science and Technology

Papers

1

Total Citations

3

H-Index

1

About

Otfried Schwarzkopf is a computational geometer whose work has shaped the foundations of algorithmic geometry, particularly in the study of visibility graphs and their applications to motion planning and spatial reasoning. His 1997 paper "Visibility Graphs," though modest in citation count, is a seminal contribution that systematically formalized the combinatorial and algorithmic properties of visibility structures in polygonal environments. Schwarzkopf's research primarily explores the intersection of computational geometry, graph theory, and robotics, where he has advanced understanding of how to efficiently compute shortest paths and visibility relations among obstacles. Beyond this core paper, his broader oeuvre includes influential work on randomized algorithms for geometric problems and the design of data structures for planar subdivisions. While his citation impact is concentrated, his ideas have been foundational for subsequent generations of researchers in computational geometry, particularly in the development of practical algorithms for autonomous navigation and geographic information systems. Schwarzkopf's legacy lies in his rigorous theoretical clarity and the enduring relevance of his geometric insights to modern spatial computing challenges.

Research Focus

Key Achievements

1
H-Index
1
Papers
3
Total Citations
3
Avg Citations/Paper
🏆 Most Cited Paper
Visibility Graphs
3 citations · 1997
📈 Most Prolific Year: 1997 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: Pohang University of Science and Technology

Top Papers

  1. 1
    Visibility Graphs
    3 citations · 1997

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago