The European Workshop of Computational Geometry is an important scientific,
annual event. Established researchers from academia, R&D people from industry,
research students and postdocs come here together to discuss their most recent
work and to establish new research projects and international cooperations.
The goal of this workshop is to provide an informal and productive atmosphere
for scientific collaboration and to bring young researchers and established
scientists together.
Website: Sascha Ternes, June 2005
Please note: The linked PDF files are scanned from the printed proceedings, and therefore quite huge in size and quite poor in quality.
Download all abstracts in one ZIP file.
| 9:00 - 9:05 | Welcome |
| 9:05 - 9:30 |
Best Cuts of a Set of Hyperrectangles Viet Hai Nguyen, Thomas Roos, Peter Widmayer (ETH Zürich) |
| 9:30 - 9:55 |
Semi-dynamic Maintenance of the Width of a Planar Point Set Christian Schwarz (Max-Planck-Institut für Informatik, Saarbrücken) |
| 9:55 - 10:20 |
Recognizing Permutations Generated by Sweeps of Planar Point Sets Hanspeter Bieri (Universität Bern), Peter-Michael Schmidt (Universität Jena) |
| 10:20 - 11:00 | Coffee break |
| 11:00 - 11:25 |
The Pathtree, a Suitable Datastructure for Parallel Rayshooting in 3-Dimensional Space Waldemar Preilowski (Universität Paderborn) |
| 11:25 - 11:50 |
About Voronoi Diagrams for Strictly Convex Distances A. G. Corbalan, Marisa Mazon, Tomas Recio (Universidad de Cantabria, Santander) |
| 11:50 - 12:15 |
On the Topological Shape of Planar Voronoi Diagrams A. G. Corbalan, Marisa Mazon, Tomas Recio, Francisco Santos (Universidad de Cantabria, Santander) |
| 12:15 - 13:45 | Lunch |
| 13:45 - 14:10 |
Euclidian Lattice Reduction Chee Yap (New York University) |
| 14:10 - 14:35 |
Mathematical Foundations of Discrete Geometry Jean-Pierre Reveilles (Université de Strasbourg) |
| 14:35 - 15:00 |
A New Approach to Quantifier Elimination for Real Algebra and Geometry Volker Weispfenning (Universität Passau) |
| 15:00 - 15:30 | Coffee break |
| 15:30 - 15:55 |
Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon Ferran Hurtado, M. Noy (Universidad Politécnica de Catalunya, Barcelona) |
| 15:55 - 16:20 |
The Complexity of the Min-max Degree Triangulation Problem Klaus Jansen (Universität Trier) |
| 17:00 | 1. GI-Fachgruppensitzung 0.1.2 Algorithmische Geometrie |
| 9:00 - 9:25 |
On Vertices and Polyhedra without Minimal Boolean Formulae Martin J. Dürst (Universität Zürich) |
| 9:25 - 9:50 |
Visualization of Algebraic Surfaces Using the Dexel Model Rudolf Eisenstöck (Universität Linz) |
| 9:50 - 10:15 |
Variational Surface Design and Surface Interrogation Hans Hagen (Universität Kaiserslautern) |
| 10:15 - 10:45 | Coffee break |
| 10:45 - 11:10 |
Geometry Theorem Proving in Vector Spaces Sabine Stifter (Universität Linz) |
| 11:10 - 11:35 |
Polytope Containment and Determination by Linear Probes Peter Gritzmann (Universität Trier), Victor Klee, John Westwater (University of Washington, Seattle) |
| 11:35 - 12:00 |
Circular Visibility Jesús García López, Pedro Ramos-Alonso (Universidad Politécnica de Madrid) |
| 12:00 - 14:30 | Lunch |
| 14:30 - 14:55 |
Dominating Polygons by Many Colors Frank Hoffmann, Klaus Kriegel (Freie Universität Berlin) |
| 14:55 - 15:20 |
Mesh Generation for the Finite Element Method (paper not available) Elefterios Melissaratos (Rijksuniversiteit Utrecht) |
| 15:20 - 15:45 |
Incremental Generation of Voronoi Diagrams of Planar Shapes Martin Held (Universität Salzburg) |
| 15:45 - 16:10 | Coffee break |
| 16:10 - 16:35 |
A Plane Sweep Algorithm for the All Nearest Neighbors Problem for a Set of Convex Planar Objects Thorsten Graf, Klaus Hinrichs (Universität Münster) |
| 16:35 - 17:00 |
Algorithms for Proximity Problems on Colored Point Sets Thorsten Graf, Klaus Hinrichs (Universität Münster) |
| 17:00 | Goodbye |
