# Computational geometry seminar: Pablo Pérez-Lantero

• Computational geometry seminar: Pablo Pérez-Lantero
• 2016-06-29T13:00:00+02:00
• 2016-06-29T14:00:00+02:00
• Given a convex polygon of n sides, one can draw n disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the n disks and two disks are adjacent if and only if they have a point in common. We prove that for every convex polygon this graph is planar.

Given a convex polygon of n sides, one can draw n disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the n disks and two disks are adjacent if and only if they have a point in common. We prove that for every convex polygon this graph is planar.

Quan
29/06/2016 de 13:00 a 14:00
On
Room 028a, C4 Building, Castelldefels Campus UPC
Afegeix un esdeveniment al calendari
iCal

COMPUTATIONAL GEOMETRY SEMINAR
Wednesday, June 29, 2016, 13:00-14:00
Room 028a, C4 Building, Castelldefels Campus UPC

Title: The intersection graph of the disks with diameters the sides of a convex n-gon
Speaker: Pablo Pérez-Lantero
Universidad de Santiago de Chile
http://www.decom-uv.cl/pperez/home/home.html