Bringing Discrete Researchers Together
More and more important research problems require extensive computational skills. Computational discrete geometry is a young and rapidly developing discipline on the boundary of mathematics and computer science. It enables researchers to tackle important problems in such areas as robotics, computer graphics, pattern recognition, shortest paths and networks, crystals and quasicrystals, and manufacturing processes. Dr. Karoly Bezdek is one of the world's leading researchers in computational discrete geometry, and is known for resolving (with Bob Connelly of Cornell University) the Kneser-Poulsen Conjecture, which was one of the best known open questions of discrete geometry for over forty years. Dr. Bezdek has done much of his work in conjunction with other mathematicians, and is therefore well positioned to lead the development of a new Centre for Computational Discrete Geometry. The Canada Research Chair will enable the creation of a research group dedicated to discrete geometry, a forum for collaborative research through seminars, joint research projects, a computer laboratory, an electronic journal called Computational Discrete Geometry, and a Web site dedicated to the field. Dr. Bezdek and his team will also tackle some concrete research problems including, among others, the Kneser-Poulsen Conjecture, the sphere packing problem (as part of Hilbert's 18th problem), the Gohberg-Markus-Hadwiger covering conjecture, the Bateman-Erdös problem in normed planes, and the Minkowski circle packings in normed planes. The goal of the Centre is to engage a regular stream of short- and medium-term visitors who will have access to a first class computational facility in discrete geometry. Through these collaborations, its electronic journal and its extensive Web site database, this centre will serve as a vital forum for researchers in the field, and will facilitate collaborations globally.