1. Computational geometry

   • Godfried T. Toussaint

   Editorial Pages: 321 - 322

2. Computing the volume of the union of spheres

   • David Avis
   • Binay K. Bhattacharya
   • Hiroshi Imai

   OriginalPaper Pages: 323 - 328

3. Hidden-surface removal in polyhedral cross-sections

   • Peter Egyed

   OriginalPaper Pages: 329 - 343

4. Recognizing polygons, or how to spy

   • James A. Dean
   • Andrzej Lingas
   • Jörg-Rüdiger Sack

   OriginalPaper Pages: 344 - 355

5. Solving visibility and separability problems on a mesh-of-processors

   • Frank Dehne

   OriginalPaper Pages: 356 - 370

6. Parallel algorithms for shortest path problems in polygons

   • Hossam ElGindy
   • Michael Goodrich

   OriginalPaper Pages: 371 - 378

7. Fast algorithms for computing the diameter of a finite planar set

   • Binay K. Bhattacharya
   • Godfried T. Toussaint

   OriginalPaper Pages: 379 - 388

8. Computer art forum

   • Nadia Magnenat-Thalmann

   Announcement Pages: 389 - 389

9. Events

   Events Pages: 390 - 392