The DCCG Computational Geometry Seminar is organized by the UPC Research Group on Discrete, Combinatorial and Computational Geometry (DCCG). The Seminar started its regular sessions at the beginning of the course 1993-1994. Since then, it has been held regularly in the period september-june, with different frecuencies of talks over the years, depending on the flow of visitors and the other activities of the group members. Since its beginning, the seminar has hosted about 300 talks.
The Seminar is fundamentally devoted to the presentation of research results in the area of discrete, combinatorial and algorithmic geometry, paying special attention to problems coming from the engineering fields, particularly from Computer Science. Currently, the seminar has a wide scope, consisting of sessions describing original research by group members or visitors, sessions devoted to the presentation of recently appeared papers, presentations of open problems, or any other topics of interest relevant to the group’s research areas. In the past, the seminar has also hosted monographic courses taught by specialists, in sets of eight or ten sessions.
(Sessions are added as soon as confirmed)
April 27, 2017 (12:15, Omega room S215). On farthest and higher-order segment Voronoi diagrams. Evanthia Papadopoulou, University of Lugano.
April 20, 2017 (12:15, Omega room S215). Topological Drawings of Complete Bipartite Graphs. Jean Cardinal, Université libre de Bruxelles.
March 30, 2017 (12:15, Omega room S217—room changed!). Geomasking through Perturbation, or Counting Points in Circles. Rodrigo Silveira, Universitat Politècnica de Catalunya.
March 23, 2017 (12:15, Omega room S215). Beam Search for packing problems with irregular pieces and guillotine cuts. Carlos Alegría-Galicia, Universidad Nacional Autónoma de México.
January 11, 2017 (12:30, Omega room S215). Geometric Algorithms for Lattice-based Modular Robots Vera Sacristán, Universitat Politècnica de Catalunya.
December 21, 2016 (12:30, Omega room S215). Star Covering of Red and Blue Points in the Plane. Carlos Seara, Universitat Politècnica de Catalunya.
November 9, 2016 (12:30, Omega room S215). The Pokémon GO search problem and its competitive analysis. Marc van Kreveld, Utrecht University.
October 19, 2016 (12:30, Omega room S215). Are higher order Delaunay triangulations useful in practice? Rodrigo Silveira, Universitat Politècnica de Catalunya.
September 22, 2016 (15:30, Omega room 409b). Advances on a Combinatorial Optimization Approach for Political Districting in México. Canek Peláez, Universidad Nacional Autónoma de México.
September 21, 2016 (12:30, Omega room S215). Straight Skeletons for Nonconvex 3D Polytopes. Franz Aurenhammer, Graz University of Technology.
Previous years sessions