Session C1: Polygons | August 16 9:00 |
Polygons Cuttable by a Circular Saw | |
Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan |
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon | |
Gill Barequet, Matthew T. Dickerson |
Flipping your Lid | |
Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin |
Reconfiguring Convex Polygons | |
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael A. Soss, Godfried T. Toussaint |
Session I1: Invited Lecture | August 16 11:00 |
Session C2.1: Circular Arcs | August 16 14:00 |
Covering Points on a Circle with Circular Arcs | |
Vladimir Filkov |
On the Shooter Location Problem | |
Stefan Langerman |
Circular Ray Shooting: Slower but Surer | |
Ralph P. Boland, Jorge Urrutia |
Session C2.2: Visibility | August 16 14:00 |
Guarding Alcove-Free Galleries | |
David Kirkpatrick |
Guarding the Convex Subsets of a Point-set | |
Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia |
A New Lower Bound for Kernel Searching | |
Peter Anderson, Alejandro López-Ortiz |
Session C3.1: Polyhedra | August 16 16:00 |
Extended Convex Hull | |
Komei Fukuda, Thomas M. Liebling, Christine Lütolf |
Incremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability | |
Sonoko Moriyama, Fumihiko Takeuchi |
Computing Cut Numbers | |
C. Sohler, M. Ziegler |
Minimal Tetrahedralizations of a Class of Polyhedra | |
Boting Yang, Cao An Wang |
Session C3.2: Geometric Graphs | August 16 16:00 |
Spanners in l1 | |
J. Cáceres, C.I. Grima, A. Márquez, A. Moreno-González |
On a straight-line embedding problem of forests | |
Shin-ichi Tokunaga |
Efficient Algorithms for Computing the beta-spectrum | |
S.V. Rao, Asish Mukhopadhyay |
Session C4: Voronoi and Relatives | August 17 9:00 |
The Medial Axis of a Union of Balls | |
Nina Amenta, Ravi Krishna Kolluri |
Computing Voronoi Diagrams of Line Segments Reliably and Efficiently | |
Martin Held |
Additively Weighted Voronoi Diagram on the Oriented Projective Plane | |
Guilherme Albuquerque Pinto, Pedro Jussieu de Rezende |
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes | |
Mordecai Golin, Hyeonsuk Na |
Session I2: Paul Erdos Memorial Lecture | August 17 11:00 |
Session C5.1: Robustness | August 17 14:00 |
An Implementation of Chen & Han's Shortest Paths Algorithm | |
Biliana Kaneva, Joseph O'Rourke |
An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments | |
Jean-Daniel Boissonnat, Antoine Vigneron |
ZEA - A zero-free exact arithmetic | |
D. Michelucci, J-M. Moreau |
Session C5.2: Area and Volume | August 17 14:00 |
Polygon Area Problems | |
Ralph P. Boland, Jorge Urrutia |
The Area Partitioning Problem | |
Hannah Bast, Susan Hert |
1-bend 3-D orthogonal drawings: two open problems solved | |
Therese C. Biedl |
Session C6.1: Queries in High Dimensions | August 17 16:00 |
Dynamic point location in fat hyperrectangles with integer coordinates | |
John Iacono, Stefan Langerman |
On Dynamic k-d Half-Space Range Reporting | |
Bradford G. Nickerson, Yunlan Pan |
Geometric Clustering for Multiplicative Mixtures of Distributions in Exponential Families | |
Mary Inaba, Hiroshi Imai |
Finding k-Closest-Pairs Efficiently for High Dimensional Data | |
Mario A. Lopez, Swanwa Liao |
Session C6.2: Block Pushing,Discrete Geometry | August 17 16:00 |
Push-* is NP-hard | |
Michael Hoffmann |
PushPush and Push-1 are NP-hard in 2D | |
Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke |
Equivalence of Arrangements of Curves | |
Manuela Neagu |
Partitioning the sphere with constant area quadrangles | |
Christophe Lemaire, Jean-Christophe Weill |
Session C7: Triangulations | August 18 9:00 |
Enumerating Triangulation Paths | |
Adrian Dumitrescu, Bernd Gaertner, Samuele Pedroni, Emo Welzl |
Selecting Independent Chains on a Triangulated 2-Manifold | |
Siu-Wing Cheng, Sheung-Hung Poon |
Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding | |
Martin Isenburg, Jack Snoeyink |
An Edgebreaker-Based Efficient Compression Scheme for Connectivity of Regular Meshes | |
Andrzej Szymczak, Davis King, Jarek Rossignac |
Session I3: IVS-NVision Annual Lecture | August 18 11:00 |
Session O1: Open Problems and Planning | August 18 14:00 |
Open Problem Session | |
Erik D. Demaine, Joseph O'Rourke |