InhaltsangabeOn the Complexity of Many Faces in Arrangements of Pseudo-Segments and of Circles.- Polyhedral Cones of Magic Cubes and Squares.- of the Polygons.- Computing the Hausdorff Distance of Geometric Patterns and Shapes.- A Sum of Squares Theorem for Visibility Complexes and Applications.- On the Reflexivity of Point Sets.- Geometric Permutations of Large Families of Translates.- Integer Points in Rotating Convex Bodies.- Complex Matroids ¨C Phirotopes and Their Realizations in Rank.- Covering the Sphere by Equal Spherical Balls.- Lower Bounds for High Dimensional Nearest Neighbor Searchand Related Problems.- A Tur´an-type Extremal Theory of Convex Geometric Graphs.- Relaxation.- A Lower Bound on the Complexity of Approximate Nearest-NeighborSearching on the Hamming.- Detecting Undersampling in Surface Reconstruction.- A Survey of the Hadwiger-Debrunner (p, q)-problem.- Surface Reconstruction by Wrapping Finite Sets in Space.- Infeasibility of Systems of Halfspaces.- Complete Combinatorial Generation of Small Point Configurations and Hyperplane.- Relative Closure and the Complexity of Pfaffian Elimination.- Are Your Polyhedra the Same as My Polyhedra.- Some Algorithms Arising in the Proof of the Kepler Conjecture.- The Minimal Number of Triangles Needed to Span a Polygon Embedded in Rd.- Jacobi Decomposition and Eigenvalues of Symmetric Matrices.- Discrete Geometry on Red and Blue Points in the Plane¨C A Survey ¨C.- Configurations with Rational Angles and Trigonometric DiophantineEquations.- Reconstructing Sets From Interpoint Distances.- Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio.- Colorings and Homomorphisms of Minor Closed Classes.- Conflict-free Colorings.- New Complexity Bounds for Cylindrical Decompositions of Sub-Pfaffian Sets.- Note on the Chromatic Number of the Space.- Expansive Motions and the Polytope of Pointed Pseudo-Triangulations.- Some Recent Quantitative and Algorithmic Results in Real Algebraic Geometry.- A Discrete Isoperimetric Inequality and Its Application to Sphere Packings.- On the Number of Maximal Regular Simplices Determined by n Points in Rd.- Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem.- Quantizing Using Lattice Intersections.- Note on a Generalization of Roth's Theorem.- Arrangements, Equivariant Maps and Partitions of Measures by k-Fans.- Qualitative Infinite Version of Erd?s' Problem About Empty Polygons.

Preface.- Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On the complexity of many faces in arrangements of pseudo-segments and of circles.- Maya Ahmed, Jesus De Loera, Raymond Hemmecke: Polyhedral cones of magic cubes and squares.- Jin Akiyama, Gisaku Nakamura: Congruent Dudeney dissections of triangles and convex quadrilaterals with hinge points on the sides of the polygon.- Helmut Alt, Peter Brass, Michael Godau, Christian Knauer, Carola Wenk: Computing the Hausdorff distance of geometric patterns and shapes.- Pierre Angelier, Michel Pocchiola: A sum of squares theorem for visibility complexes and applications.- Esther Arkin, Sandor Fekete, Ferran Hurtado, Joseph Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia: On the reflexivity of point sets.- Andrei Asinowski, Andreas Holmsen, Meir Katchalski, Helge Tverberg: Geometric permutations of large families of translates.- Imre Barany, Jiri Matousek: Integer points in rotating convex bodies.- Alexander Below, Vanessa Krummeck, Jurgen Richter-Gebert: Complex matroids, phirotopes and their realizations in rank 2.- Karoly Boroczky, Jr., Gergely Wintsche: Covering the sphere by equal spherical balls.- Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Lower bounds for high dimensional nearest neighbor search and related problems.- Peter Brass, Gyula Karolyi, Pavel Valtr: An extremal theory of convex geometric graphs and related structures.- Andreas Brieden, Peter Gritzman: On the approximability of polynomial-programming, the geometry of stable sets, and the power of relaxation.- Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube.- Tamal Dey, Joachim Giesen: Detecting undersampling in surface reconstruction.- Jurgen Eckhoff: A survey of the Hadwiger-Debrunner (p,q)-problem.- Herbert Edelsbrunner: Surface reconstruction by wrapping finite sets in space.- Stefan Felsner, Nicole Morawe: Infeasibility of systems of halfspaces.- Lukas Finschi, Komei Fukuda: Combinatorial generation of small point configurations and hyperplane arrangements.- Andrei Gabrielov: Relative closure of semi-Pfaffian sets.- Branko Grunbaum: Are your polyhedra the same as my polyhedra?- Thomas C. Hales: Some algorithms arising in the proof of the Kepler conjecture.- Joel Hass, Jeffrey C. Lagarias: The Number of Triangles Needed to Span a Polygon Embedded in R^d.- W. He, N. Prabhu: Jacobi decomposition and eigenvalues of symmetric matrices.- Atsushi Kaneko, Mikio Kano: Discrete geometry on red and blue points in the plane -- A survey.- Miklos Laczkovich: Configurations with rational angles and trigonometric Diphantine equations.- Boris D. Lubachevsky, Ronald L. Graham: Dense packings of congruent circles in rectangles with a variable aspect ratio.- Jaroslav Nesetril, Patrice Ossona de Mendez: Colorings and homomorphisms of minor closed classes.- Janos Pach and Geza Toth: Conflict free colorings.- Sawas Pericleous, Nicolai Vorobjov: New complexity bounds for cylindrical decompositions of sub-Pfaffian sets.- Rados Radoicic, Geza Toth: On the Hadwiger-Nelson problem.- Gunter Rote, Francisco Santos, Ileana Streinu: Expansive motions and the polytope of pointed pseudo-triangulations.- Marie-Francoise Roy: Some recent quantitative and algorithmic results in real algebraic geometry.- Peter Scholl, Achill Schurmann, Jorg M. Wills: A discrete isoperimetric inequality and its application to sphere packings.- Zvi Schur, Yakov Kupitz, Horst Martini, Micha Perles: On the number of regular simplices determined by n points in R^d.- Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem.- Steve Skiena, Warren D. Smith, Paul Lemke: Reconstructing sets from interpoint distances.- N.J.A. Sloane, B. Beferull-Lozano: Quantizing using lattice intersections.- Jozsef Solymosi: Note on a generalization of Roth's theorem.- Sinisa Vrecica, Rade Zivaljevic: Arrangements, equivaria ...