Tiling Algorithms

HKUST CS Theory Group Seminar

Title: "Tiling Algorithms"

Speaker:  Stefan Langerman
Université Libre de Bruxelles

Date/Time: Tuesday, Sept 19th, 11AM
Venue: Room 3523 (Lifts 25-26)

Abstract: A tiling is a covering of the plane with copies of one or more
geometric shape tiles without gaps or overlaps.

Tilings have been used since ancient times in construction, design and
art, to create beautiful and mesmerizing patterns. But how does a designer
go about creating a set of tiles? And once these tiles are at hand, how
does one assemble them to cover the plane?

In this talk, I will go over the history of tiling algorithms, outline
exciting developments from recent years, and highlight some of my favorite
open problems on the subject.

Biography: Stefan Langerman obtained his Ph.D. from Rutgers University in
2001. In 2002 he joined the Computer Science Department at the Université
Libre de Bruxelles (ULB) in Belgium where he is currently a Professor and
also Research Director for the F.R.S.-FNRS. His main research interests
are in Discrete and Computational Geometry, Algorithms and Data