Articles

1. A geometric inequality and the complexity of computing volume

   • G. Elekes

   OriginalPaper 01 December 1986 Pages: 289 - 292

2. Periodic orbits for additive cellular automata

   • Raul Cordovil
   • Rui Dilão
   • Ana Noronha da Costa

   OriginalPaper 01 September 1986 Pages: 277 - 288

3. Diameter partitioning

   • David Avis

   OriginalPaper 01 September 1986 Pages: 265 - 276

4. Approximation of convex discs by polygons

   • A. Florian

   OriginalPaper 01 September 1986 Pages: 241 - 263

5. On the cone of nonnegative circuits

   • Alan J. Hoffman
   • Carl W. Lee

   OriginalPaper 01 September 1986 Pages: 229 - 239

6. Upper bounds for configurations and polytopes inR ^d

   • Jacob E. Goodman
   • Richard Pollack

   OriginalPaper 01 September 1986 Pages: 219 - 227

7. Generalized delaunay triangulation for planar graphs

   • D. T. Lee
   • A. K. Lin

   OriginalPaper 01 September 1986 Pages: 201 - 217

8. On polyhedra with transitivity properties

   • J. M. Wills

   OriginalPaper 01 September 1986 Pages: 195 - 199

9. Some basic properties of packing and covering constants

   • H. Groemer

   OriginalPaper 01 June 1986 Pages: 183 - 193

10. A polynomial solution for the potato-peeling problem

    • J. S. Chang
    • C. K. Yap

    OriginalPaper 01 June 1986 Pages: 155 - 182

11. Geometric realizations for Dyck's regular map on a surface of genus 3

    • E. Schulte
    • J. M. Wills

    OriginalPaper 01 June 1986 Pages: 141 - 153

12. Smooth, easy to compute interpolating splines

    • John D. Hobby

    OriginalPaper 01 June 1986 Pages: 123 - 140

13. Spherical complexes and nonprojective toric varieties

    • Günter Ewald

    OriginalPaper 01 June 1986 Pages: 115 - 122

14. Computing circular separability

    • Joseph O'Rourke
    • S. Rao Kosaraju
    • Nimrod Megiddo

    OriginalPaper 01 June 1986 Pages: 105 - 113

15. A resolution of the sylvester-gallai problem of J.-P. serre

    • L. M. Kelly

    OriginalPaper 01 June 1986 Pages: 101 - 104

16. More onk-sets of finite sets in the plane

    • Emo Welzl

    OriginalPaper 01 March 1986 Pages: 95 - 100

17. Halfspace range search: An algorithmic application ofk-sets

    • B. Chazelle
    • F. P. Preparata

    OriginalPaper 01 March 1986 Pages: 83 - 93

18. Covering the plane with convex polygons

    • János Pach

    OriginalPaper 01 March 1986 Pages: 73 - 81

19. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

    • Klara Kedem
    • Ron Livne
    • Micha Sharir

    OriginalPaper 01 March 1986 Pages: 59 - 71

20. Can you cover your shadows?

    • H. E. Debrunner
    • P. Mani-Levitska

    OriginalPaper 01 March 1986 Pages: 45 - 58

21. Voronoi diagrams and arrangements

    • Herbert Edelsbrunner
    • Raimund Seidel

    OriginalPaper 01 March 1986 Pages: 25 - 44

22. Two poset polytopes

    • Richard P. Stanley

    OriginalPaper 01 March 1986 Pages: 9 - 23

23. Covering a square by small perimeter rectangles

    • N. Alon
    • D. J. Kleitman

    OriginalPaper 01 March 1986 Pages: 1 - 7