General Information Program Submissions Fees & Registration Bonn Information
What is new? Accomodation Travel Information Contact
Home
Program



Monday,
March 24th


08:00 - 09:00 Registration and welcome reception
09:00 - 09:10 Welcome
09:10 - 09:30 The one-round Voronoi game replayed
Fekete, S.P., Meijer, H.
09:30 - 09:50 The Voronoi diagram for n disjoint spherical sites of 0(1) different radii has complexity 0(n^2)
Ó Dúnlaing, C.
09:50 - 10:10 The anchored Voronoi diagram: static and dynamic versions and applications
Barcia, J.A., Diaz-Bánez, J.M., Gómez, F., Ventura, I.
10:10 - 10:30 Approximating planar subdivisions and generalized Voronoi diagrams from random sections
Coll, N., Hurtado, F., Sellarès, J.A.
10:30 - 11:00 Coffee break
11:00 - 11:20 Sweeping an arrangement of quadrics in 3D
Mourrain, B., Técourt, J.-P., Teillaud, M.
11:20 - 11:40 Parametric voxel geometry control for digital morphogenesis
Fischer, Th., Fischer, To.
11:40 - 12:00 Controlled perturbation for arrangements of circles
Halperin, D., Leiserowitz, E.
12:00 - 13:00 Lunch
13:00 - 14:00 Invited Lecture: Geometric approximation using core sets
Pankaj Kumar Agarwal, Duke Univerity
14:00 - 14:20 Coffee break
14:20 - 14:40 Vertex cover and connected guard set
Zylinski, P.
14:40 - 15:00 An optimal competitive on-line algorithm for the minimal clique
Jaromczyk, J.W., Pezarski, A., Slusarek, M.
15:00 - 15:20 Convex sets in graphs
Cáceres, J., Márquez, A., Oellermann, O.R., Puertas, M.L.
15:20 - 15:40 Graphs of triangulations and perfect matchings
Houle, M., Hurtado, F., Noy, M., Rivera-Campo, E.
15:40 - 16:00 Coffee break
16:00 - 16:20 Computing the detour of polygons
Grüne, A., Klein, R., Langetepe, E.
16:20 - 16:40 More results about spanners in the l1-metric
Cáceres, J., Grima, C.I., Márques, A., Moreno-Gonzáles, A.
16:40 - 17:00 Approximately matching polygonal curves under translation, rotation and scaling with respect to the Fréchet-distance
Clausen, M., Mosig, A.



Tuesday,
March 25th


09:00 - 10:00 Invited Lecture: Approximation algorithms for geometric shortest path problems
Jörg-Rüdiger Sack, Carleton University
10:00 - 10:20 Coffee break
10:20 - 10:40 The polytope of non-crossing graphs on a planar point set
Orden, D., Santos, F.
10:40 - 11:00 Affine representations of abstract convex geometries
Kashiwabara, K., Nakamura, M., Okamoto, Y.
11:00 - 11:20 Maximum subsets in Euclidean position in Euclidean 2-orbifolds and the sphere
Abellanas, M., Cortés, C., Hernández, G., Márquez, A., Valenzuela, J.
11:20 - 11:40 Optimal pants decompositions and shortest freely homotopic loops on an orientable surface
Colin de Verdière, É., Lazarus, F.
11:40 - 12:00 Geometric games on triangulations
Aichholzer, O., Bremner, D., Demaine, E.D., Hurtado, F., Kranakis, E., Krasser, H., Ramaswami, S., Sethia, S., Urrutia, J.
12:00 - 13:00 Lunch
13:00 - 13:20 Cutting triangular cycles of lines in space
Aronov, B., Koltun, V., Sharir, M.
13:20 - 13:40 Red-blue separability problems in 3D
Hurtado, F., Seara, C., Sethia, S.
13:40 - 14:00 The maximum number of edges in a three-dimensional grid-drawing
Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.
14:00 - 14:20 Coffee break
14:20 - 14:40 Constrained higher order Delaunay triangulations
Gudmundsson, J., Haverkort, H., van Kreveld, M.
14:40 - 15:00 An approach to exhaustive generation on objects without testing on isomorphisms. Application of the method to the cell growth problem
Alboul, L., Netchaev, A.
15:00 - 15:20 Kinetic convex hull maintenance using nested convex hulls
Razzazi, M.R., Sajedi, A.
15:20 - 15:40 Coffee break
15:40 - 16:00 Optimal tolerancing in mechanical design using polyhedral computation tools
Fukuda, K., Petit, J.-P.
16:00 - 16:20 Approximating the visible region of a point on a terrain
Ben-Moshe, B., Carmi, P., Katz, M.J.
16:20 - 16:40 Pheromone-guided dispersion for swarms of robots
Hsiang, T.-R., Sztainberg, M.
16:40 - 17:00 Business meeting
19:30 Conference dinner



Wednesday,
March 26th


09:15 - 10:15 Invited Lecture: Similarity between image and terrain: Geometric approaches to computer vision
Tetsuo Asano, JAIST
10:15 - 10:40 Coffee break
10:40 - 11:00 Orthogonal segment stabbing
Katz, M.J., Mitchell, J.S.B., Nir, Y.
11:00 - 11:20 Alternating paths along orthogonal segments
Tóth, C.D.
11:20 - 11:40 Shortest paths in polygonal domains with polygon-meet constraints
Khosravi, R., Ghodsi, M.
11:40 - 12:00 Tiling polyominoes with squares that touch the boundary
Spillner, A.
12:00 - 13:00 Lunch
13:00 - 13:20 Best fitting rectangles
Abellanas, M., Hurtado, F., Icking, C., Ma, L., Palop B., Ramos, P.A.
13:20 - 13:40 Algorithms for placing and connecting facilities and their comparative analysis
Kedem, K., Rabaev, I., Sokolovsky, N.
13:40 - 14:00 Chips on wafers, or packing rectangles into grids
Andersson, M., Gudmundsson, J., Levcopoulos, C.
14:00 - 14:20 Unit height k-Position map labeling
Rostamabadi, F., Ghodsi, M.
14:20 - 14:40 Coffee break
14:40 - 15:00 Good NEWS: Partitioning a simple polygon by compass directions
van Kreveld, M., Reinbacher, I.
15:00 - 15:20 Significant-presence range queries in categorical data
de Berg, M., Haverkort, H.J.
15:20 - 15:40 Efficient contour tree construction and computation of Betti numbers in scalar fields
Lenz, T., Rote, G.
15:40 - 15:45 Good-bye



Thursday,
March 27th


10:00 - 14:00 Excursion