DCGD 2008

2015 (UU) · 2013 (TU/e) · 2012 (UU) · 2010 (TU/e) · 2009 (UU) · 2008 (TU/e) · 2007 (UU) · 2006 (TU/e) · 2005 (UU) · 2004 (TU/e)


5th Dutch Computational Geometry Day

Date: 3 July 2008
Location: TU Eindhoven, Kennispoort, "Groote Zaal" on the first floor marked with KP on the map below
Registration: Send email to Herman Haverkort, stating name, affiliation, if you will join us for dinner, and any dietary restrictions you may have.


Time Speaker Title
10:30 - 10:50Arno KamphuisPath planning for coherent groups in corridors
10:50 - 11:10Bart JansenHeuristics for Road Network Augmentation
11:10 - 11:30Edward VerbreeValidation and storage of polyhedra through constrained Delaunay tetrahedralization
11:30 - 11:45Minibreak
11:45 - 12:45Sándor Fekete

(invited speaker)

Geometric Problems of Sensor Swarms

Considering a large swarm of locally communicating processor nodes is a hot topic with a wide range of algorithmic aspects; not all of them are directly connected, but most of them offer exciting challenges.

Most of this talk will consider a geometric optimization problem of classical flavor: how can we add an appropriate set of relay nodes that makes a given set of sensors connected? At the end of the talk, I will present some very different results for a problem of swarms of dynamic objects that affects all of us: cars in a traffic jam.

14:00 - 14:20Fred van NijnattenRange assignment in wireless networks with directional antennas
14:20 - 14:40Kevin VerbeekUntangling rectilinear paths
14:40 - 15:10Mark de BergKinetic spanners
15:10 - 15:50Coffee
15:50 - 16:10Constantinos TsirogiannisLinear smoothed complexity of visibility maps on realistic terrains
16:10 - 16:30Markus KrugPlanar geodesic grid drawings
16:30 - 16:50Maarten LöfflerDelaunay triangulation of imprecise points in linear time after preprocessing
just across the Dommel
17:00Borrel at "De Zwarte Doos"
20 min. walk to Grote Berg 10
18:30Dinner at "De Karseboom"


Campus map

Map of TU/e campus