Parallel Algorithms for Geometric Problems.

Abstract

The existence of parallel computing systems and the important applications of geometric solutions have motivated our study on the design and analysis algorithms for solving geometric problems on two parallel computing systems: the Shared Memory Machine (SMM) and the Cube-Connected-Cycles (CCC). The validity of the first SMM resides in uncovering the inherent data-dependence of the problems, while that of the CCC, which complies with the VLSI technological constraints, is the development of practical parallel algorithms. It is shown that solutions to geometric problems can be organized to reveal a large amount of parallelism, which can be exploited to substantially reduce the computation time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1981
Accession Number
ADA124353

Entities

People

  • Anita L. Chow

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Computational Science
  • Computations
  • Computer Graphics
  • Computer Science
  • Geometry
  • Image Processing
  • Intellectual Property
  • Iterations
  • Models
  • Network Protocols
  • Numerical Analysis
  • Parallel Computing
  • Pattern Recognition
  • Three Dimensional
  • Trees (Data Structures)
  • Two Dimensional

Fields of Study

  • Computer science
  • Engineering

Readers

  • Calculus or Mathematical Analysis
  • Parallel and Distributed Computing.
  • Systems Analysis and Design