Scholar
Jacobus Conradi
Google Scholar ID: ZRw2jAMAAAAJ
M.Sc., University of Bonn
Citations & Impact
Citations
59
H-index
4
i10-index
2
Publications
15
Co-authors
0
Publications
Resume
Research Experience
- Currently a postdoctoral researcher in the Algorithms and Complexity group at the University of Copenhagen, working with Mikkel Abrahamsen
- Previously conducted research in computational geometry at the University of Bonn under Anne Driemel
- Ph.D. work focused on classical problems including clustering, nearest neighbor identification, and curve segmentation
- Developed approximation tools for polygonal curves using distance measures such as Fréchet Distance and Dynamic Time Warping (DTW)
- Recent projects include polygon triangulations for finite element analysis, a well-behaved variant of the Art Gallery Problem, and generalized polygon shape matching
Background
- Research focuses on computational geometry and algorithm design
- Interested in how geometric structure influences what algorithms can and cannot do
- Aims to understand the boundary between efficiently solvable and inherently hard problems
- Primarily studies similarity measures for geometric objects (e.g., curves, trajectories), their algorithmic complexity, and applications in clustering, segmentation, and nearest-neighbor search
- Interests have broadened to a wider range of geometric and combinatorial questions
- Values the interplay between theory and experiment, often testing algorithms on real-world data