|
|
|
|
|
|
|
|
Workshop on Crossing-Free Geometric Graphs
September 24-28, 2012
ETH Zürich, Switzerland
|
|
Talks
- Sep 25, 12:15: Flip Distance Between Triangulations of a Simple Polygon is NP-Complete (Alexander Pilz)
- Sep 26, 12:15: An Aggregative Counting Algorithm for the Triangulations of a Planar Point Set (Raimund Seidel)
|
|
|
- Oswin Aichholzer, TU Graz
- Boris Aronov, NYU
- Thomas Hackl, TU Graz
- Michael Hoffmann, ETHZ
- Vincent Kusters, ETHZ
- Alexander Pilz, TU Graz
- Raimund Seidel, U. des Saarlandes
- Birgit Vogtenhuber, TU Graz
- Emo Welzl, ETHZ
|
|
|
|
|
Last Modified: $Date: 2012/05/30 18:00 $ by $Author: hoffmann $. |
|