Richard Jou

Learn More
In this paper, we present some efficient parallel geometric algorithms for computing the All Nearest Neighbors, Delaunay Triangulation, Convex Hull, and Voronoi Diagram of a point set <i>S</i> with <i>N</i> points in the plane. The algorithm of All Nearest Neighbors is to find the nearest-neighbor point for each point in <i>S</i>. It can be applied to(More)
Through its grants, the National Science Foundation sponsors workshops that inform faculty of current topics in Computer Science. Such a workshop, entitled, "Developing Multimedia-based Interactive Laboratory Modules for Computer Science", was given July 27-August 6, 1998, at Illinois State University in Normal, Illinois. Each participant was expected to(More)
  • 1