As more computers have incorporated some form of parallelism, the emphasis in algorithm
design has shifted from sequential algorithms to parallel algorithms, that is, algorithms in …

This book is a revised version of my Doctoral Dissertation, which was completed at the
Massachusetts Institute of Technology in November, 1988. The main purpose of the work …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Parallel computational geometry | Guide books skip to main content ACM Digital Library home
ACM Association for Computing Machinery corporate logo Google, Inc. (search) Advanced …

Algorithms Sequential And Parallel | Guide books skip to main content ACM Digital Library
home ACM Association for Computing Machinery corporate logo Google, Inc. (search) …

The transitive closure problem in O (1) time is solved by a new method that is far different
from the conventional solution method. On processor arrays with reconfigurable bus …

The randomized incremental convex hull algorithm is one of the most practical and important
geometric algorithms in the literature. Due to its simplicity, and the fact that many points or …

We give fast randomized and deterministic parallel methods for constructing convex hulls in
R/sup d/, for any fixed d. Our methods are for the weakest shared-memory model, the EREW …

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the
analysis of many simulated and measured datasets: N-body simulations, molecular …

We present a randomized parallel algorithm for constructing the 3D convex hull on a generic
p-processor coarse grained multicomputer with arbitrary interconnection network and n/p …