# J. Mark Keil

##
B.Sc., M.Sc. (BC), Ph.D. (Toronto)

Mark's primary research interest is in the development of algorithms
in computational geometry and graph theory. In computational geometry,
he is particularly interested in location problems, triangulations, and
polygon decomposition. In graph theory, he has concentrated on the development
of polynomial time algorithms for restricted classes of graphs.
Handy Links

Polygon Decomposition survey in
Handbook of Computational Geometry, ed. J.R. Sack and J. Urrutia,
Elsevier Science Publishing, 2000.