Discrete & Computational Geometry is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It accepts research articles of high quality in discrete geometry and on the design and analysis of geometric algorithms; more specifically, DCG publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometry of numbers, and motion planning, as well as papers with a distinct geometric flavor in such areas as graph theory, mathematical programming, real algebraic geometry, matroids, solid modeling, computer graphics, combinatorial optimization, image processing, pattern recognition, crystallography, VLSI design, and robotics.