Parallel Processing for Geometric Applications

Narayanaswami develops a framework for parallelization of geometric algorithms which is used to develop algorithms for fundamental problems that frequently occur. For example: how to determine the convex hull of a set of points in the plane, the intersections between a set of segments in the plane and the boundaries of the boolean combinations of polygons and polyhedra. At each step of the way, experimental results are given which indicate the appropriateness of the solution. This book is aimed at academic and industrial researchers in parallel processing, and in computer graphics and visualization. This book should be of interest to academic and industrial researchers in parallel processing and in computer graphics and visualization.
 
Narayanaswami develops a framework for parallelization of geometric algorithms which is used to develop algorithms for fundamental problems that frequently occur. For example: how to determine the convex hull of a set of points in the plane, the intersections between a set of segments in the plane and the boundaries of the boolean combinations of polygons and polyhedra. At each step of the way, experimental results are given which indicate the appropriateness of the solution. This book is aimed at academic and industrial researchers in parallel processing, and in computer graphics and visualization. This book should be of interest to academic and industrial researchers in parallel processing and in computer graphics and visualization.