Joachim Gudmundsson
PhD in Computer Science
Dr
ARC Future Fellow
Research ?? (Sydney Algorithms and Computing Theory group)
SIT Building J12, Room 416
(Cnr Cleveland St and City Rd)
P: +61 2 9351 4494
F: +61 2 9351 3838
E: Joachim DOT gudmundsson AT Sydney DOT edu DOT au
URL http://www.it.usyd.edu.au/~joachim
Research interests
Algorithms, Computational geometry, data structures,
approximation algorithms
Selected publications
The following list is a selection from publications (approx
10).






B. Djordjevic, J. Gudmundsson, A. Pham and T. Wolle.
Detecting Regular Visit Patterns. Algorithmica,
60(4):829–852, 2011.
K. Buchin, M. Buchin and J. Gudmundsson. Constrained free
space diagrams: a tool for trajectory analysis.
International Journal of GIS, 24(7):1101–1125, 2010.
M. Farshi and J. Gudmundsson. Experimental study of
geometric t-spanners. ACM Journal of Experimental
Algorithmics, 14(1):3–39, 2009.
H.-K. Ahn, S. W. Bae, O. Cheong and J. Gudmundsson.
Aperture-Angle and Hausdorff-Approximation of Convex
Figures. Discrete & Computational Geometry, 40(3):414429, 2008.
J. Gudmundsson, C. Levcopoulos, G. Narasimhan and M.
Smid. Approximate Shortest Path Oracles. ACM Transactions
on Algorithm, 4(1), 2008.
M. Farshi, P. Giannopoulos and J. Gudmundsson. Finding
the best shortcut in a geometric network. SIAM Journal on
Computing, 38(1):226-240, 2008.




J. Gudmundsson, M. van Kreveld and B. Speckmann.
Efficient Detection of Motion Patterns in Spatio-Temporal
Data Sets. GeoInformatica, 11(2):195-215, 2007.
L. Devroye, J.Gudmundsson and P. Morin. On the expected
maximum degree of Gabriel and Yao graphs. Advances in
Applied Probability, 41(4):1123-1140, 2009.
J. Gudmundsson, C. Levcopoulos and G. Narasimhan.
Improved Greedy Algorithms for Constructing Sparse
Geometric Spanners. SIAM Journal of Computing,
31(5):1479–1500, 2002.
M. Ali Abam, M. de Berg, M. Farshi, J. Gudmundsson and
M. Smid. Geometric Spanners for Weighted Point Sets.
Algorithmica, 61(1):207-225, 2011.
Units of study taught: COMP5045