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.
2021 seminar sessions
(Sessions are added as soon as confirmed)
April 26, 2022 (16:00, online using Google Meet). k-Transmitter Watchman Routes. Bengt J. Nilsson (Malmö University).
March 22, 2022 (16:00, online using Google Meet). Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. Javier Tejel (Universidad de Zaragoza).
March 10, 2022 (16:00, online using Google Meet). Special double session.
Spanning ratio of shortest paths in weighted square tessellations. Guillermo Esteban (Universidad de Alcalá and Carleton University).
Properties for Voronoi Diagrams of Arbitrary Order on the Sphere. Andrea de Las Heras (UPC).
November 23, 2021 (16:00, online using Google Meet). Illuminating a line segment or a line by alpha-floodlights. Leonidas Palios (University of Ioannina, Greece).
October 26, 2021 (16:00, online using Google Meet). Terrain prickliness: theoretical grounds for high complexity viewsheds. Rodrigo Silveira (UPC).
July 1, 2021 (16:00, online using Google Meet). On the intersection graph of the disks with diameters the sides of a convex n-gon. Luis Hernán Herrera Becerra (Universidad de Santiago de Chile, USACH).
May 27, 2021 (16:00, online using Google Meet). Laplacian spectrum of token graphs. Ana Laura Trujillo (CINVESTAV, Mexico).
May 6, 2021 (16:00, online using Google Meet). Fragile Complexity of Adaptive Algorithms. Pilar Cano (Université Libre de Bruxelles),
April 29, 2021 (16:00, online using Google Meet). On Maximum-Sum Matchings of Points. Oscar Chacón-Rivera (Universidad de Santiago de Chile).
March 25, 2021 (16:00, online using Google Meet). Algorithmic Geometry with Infinite Computation. Adrián Tobar Nicolau, UPC.
February 25, 2021 (16:00, online using Google Meet). Rectilinear convex hull of points in 3D. Carlos Seara, UPC.
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