Computing the volume of the union of spheres David AvisBinay K. BhattacharyaHiroshi Imai OriginalPaper Pages: 323 - 328
Recognizing polygons, or how to spy James A. DeanAndrzej LingasJörg-Rüdiger Sack OriginalPaper Pages: 344 - 355
Solving visibility and separability problems on a mesh-of-processors Frank Dehne OriginalPaper Pages: 356 - 370
Parallel algorithms for shortest path problems in polygons Hossam ElGindyMichael Goodrich OriginalPaper Pages: 371 - 378
Fast algorithms for computing the diameter of a finite planar set Binay K. BhattacharyaGodfried T. Toussaint OriginalPaper Pages: 379 - 388