BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Plone.org//NONSGML plone.app.event//EN
X-WR-TIMEZONE:Europe/Madrid
BEGIN:VEVENT
SUMMARY:Computational geometry seminar: Pablo Pérez-Lantero
DTSTART;TZID=Europe/Madrid:20160629T130000
DTEND;TZID=Europe/Madrid:20160629T140000
DTSTAMP:20260407T084137Z
UID:02bf55ee8f9445dcb36ab56e76623da6@www.mat.upc.edu
CREATED:20160622T092159Z
DESCRIPTION:Given a convex polygon of n sides\, one can draw n disks (call
 ed side disks) where each disk has a different side of the polygon as diam
 eter 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 disk
 s are adjacent if and only if they have a point in common. We prove that f
 or every convex polygon this graph is planar.
LAST-MODIFIED:20211109T111646Z
LOCATION:Room 028a\, C4 Building\, Castelldefels Campus UPC
URL:https://mat.upc.edu/ca/activitats/computational-geometry-seminar-pablo
 -perez-lantero
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Madrid
X-LIC-LOCATION:Europe/Madrid
BEGIN:DAYLIGHT
DTSTART:20160327T030000
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR