Stabbing segments with constant-complexity objects
Decanato - Facoltà di scienze informatiche
Data d'inizio: 24 Settembre 2014
Data di fine: 25 Settembre 2014
The Faculty of Informatics is pleased to announce a seminar given by Carlos Seara
DATE: Wednesday, September 24th 2014
PLACE: USI Lugano Campus, room A24, Red building (Via G. Buffi 13)
TIME: 13.30
ABSTRACT:
In this talk we consider the problem of stabbing a set $S$ of $n$ line segment in the plane by objects of constant complexity, i.e., a line, a wedge, double wedge, two parallel lines, a quadrant, three isothetic lines, an isothetic rectangle or box, a circle, etc. We will describe the algorithms for computing all the combinatorially different stabbing objects for $S$ (if one exists) showing also the time and space complexities.
BIO:
Carlos Seara (http://www-ma2.upc.edu/seara/) is assistant professor in the Department Matemática Aplicada 2 of the Universidad Politécnica de Catalunya (UPC), and a member of the UPC Research Group on Discrete, Combinatorial and Computational Geometry.
HOST: Prof. Evanthia Papadopoulou
