Michiel Smid

Carleton Univ., School of Computer Science
http://www.scs.carleton.ca/~michiel/
michiel@scs.carleton.ca

Author, editor, or reviewer of:

• An $O(n\log n)$ algorithm for finding a $k$-point subset with minimal $L_\infty$-diameter
• Approximating geometric bottleneck shortest paths
• Approximating the stretch factor of Euclidean graphs
• Approximation algorithms for the bottleneck stretch factor problem
• Closest-point problems in computational geometry
• Computing the smallest T-shaped polygon containing $k$ points
• Constructing plane spanners of bounded degree and low weight
• Geometric algorithms for density-based data clustering
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
• Static and dynamic algorithms for $k$-point clustering problems
• Translating a planar object to maximize point containment
• Proc. 8th Int. Worksh. Algorithms and Data Structures (WADS 2003)