Parallel computational geometry
Author(s)
Bibliographic Information
Parallel computational geometry
Prentice Hall, c1993
Available at / 23 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 195-210) and indexes
Description and Table of Contents
Description
This is a unified, tutorial description of the most widely used models of parallel computation and their application to problems in computational geometry. Each chapter offers an in-depth analysis of a problem in computational geometry and presents parallel algorithms to solve them. Comparative tables summarize the various algorithms developed to solve each problem. A wide range of models of parallel computation to develop the algorithms - parallel random access machine (PRAM) - are considered, as well as several networks for interconnecting processors on a parallel computer.
Table of Contents
- Models of parallel computation
- convex hull
- intersection problems
- geometric searching
- visibility and separability
- nearest neighbours
- Vonoroi diagrams
- geometric optimization
- triangulation of polygons and point sets
- current trends
- future directions.
by "Nielsen BookData"