1. A simple and relatively efficient triangulation of then-cube

   • Mark Haiman

   OriginalPaper 26 June 2007 Pages: 287 - 289

2. On the convex hull of uniform random points in a simpled-polytope

   • Fernando Affentranger
   • John A. Wieacker

   OriginalPaper 26 June 2007 Pages: 291 - 305

3. On levels in arrangements and voronoi diagrams

   • Ketan Mulmuley

   OriginalPaper 26 June 2007 Pages: 307 - 338

4. On Graver's conjecture concerning the rigidity problem of graphs

   • Hiroshi Maehara

   OriginalPaper 26 June 2007 Pages: 339 - 342

5. Higher-dimensional voronoi diagrams in linear expected time

   • Rex A. Dwyer

   OriginalPaper 26 June 2007 Pages: 343 - 367

6. A sparse graph almost as good as the complete graph on points inK dimensions

   • Pravin M. Vaidya

   OriginalPaper 26 June 2007 Pages: 369 - 381

7. Guest editor's foreword

   • Frances Yao

   EditorialNotes 26 June 2007 Pages: 383 - 383

8. Cutting hyperplane arrangements

   • Jiři Matoušek

   OriginalPaper 26 June 2007 Pages: 385 - 406

9. Euclidean minimum spanning trees and bichromatic closest pairs

   • Pankaj K. Agarwal
   • Herbert Edelsbrunner
   • Emo Welzl

   OriginalPaper 26 June 2007 Pages: 407 - 422

10. Small-dimensional linear programming and convex hulls made easy

    • Raimund Seidel

    OriginalPaper 26 June 2007 Pages: 423 - 434

11. Points and triangles in the plane and halving planes in space

    • Boris Aronov
    • Bernard Chazelle
    • Rephael Wenger

    OriginalPaper 26 June 2007 Pages: 435 - 442

12. Some provably hard crossing number problems

    • Daniel Bienstock

    OriginalPaper 26 June 2007 Pages: 443 - 459

13. An exact algorithm for kinodynamic planning in the plane

    • John Canny
    • Ashutosh Rege
    • John Reif

    OriginalPaper 26 June 2007 Pages: 461 - 484

14. Triangulating a simple polygon in linear time

    • Bernard Chazelle

    OriginalPaper 26 June 2007 Pages: 485 - 524