DCCG Seminar on Computational Geometry

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.

Upcoming sessions

(Sessions are added as soon as confirmed)

Recent past sessions

January 30, 2020 (12:00, Omega room S215). Pleaching pencil & paper picture puzzles. Maarten Löffler, Utrecht University.

January 9, 2020 (12:00, Omega room S215). Graph Drawing via Layered Partitions. Vida Dujmovic, University of Ottawa.

October 23, 2019 (15:00, Omega room S215). Topological Data Analysis for Prostate Cancer Tissue Analysis and Map Comparison. Carola Wenk (Tulane University).

July 18, 2019 (15:00, Omega room S215). Hamiltonicity for convex shape Delaunay and Gabriel graphs. Pilar Cano (UPC).

June 27, 2019 (16:00, Omega room S215).
Special session with three talks.

Optimal coordinated motions for two squares. Víctor Ruiz (UPC).

Interpolating shapes with singularities using toric orbifolds. Ander Elkoroaristizabal Peleteiro (UPC).

Erhart positivity of orbit polytopes . Filip Cano Córdoba (UPC).

January 22, 2019 (12:15, Omega room S215). Computing optimal shortcuts for networks. Rodrigo I. Silveira (UPC).

October 26, 2018 (12:15, Omega room S215). Firefighter Problems and Ant Colony Optimization. Karla García (UNAM).

October 19, 2018 (12:15, Omega room S215). Separating a polyhedron from its single-part mold: Optimal algorithms. Dan Halperin (Tel-Aviv University).

September 14, 2018 (12:15, Omega room S215). Galaxias conservativas. Joaquín Tey

Previous years sessions

Activities 2017-2018
Activities 2016-2017
Activities 2015-2016
Activities 2014-2015

Activities 2013-2014
Activities 2012-2013
Activities 2010-2012
Activities 2008-2009
Activities 2007-2008
Activities 2006-2007
Activities 2005-2006
Activities 2004-2005
Activities 2003-2004
Activities 2002-2003
Activities 2001-2002
Activities 2000-2001
Activities 1999-2000
Activities 1998-1999
Activities 1997-1998
Activities 1996-1997
Activities 1995-1996