Computational Geometry on a Systolic Chip

Abstract

This paper describes systolic algorithms for a number of geometric problems. Implementations yielding maximal throughput are given for solving dynamic versions of convex hull, inclusion, range and inverse range search, planar point location, intersection, triangulation, and closest-point problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1982
Accession Number
ADA123362

Entities

People

  • Bernard Chazelle

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Traffic
  • Algorithms
  • Boundaries
  • Computations
  • Computer Graphics
  • Computer Programming
  • Computer Science
  • Computers
  • Data Rate
  • Geometry
  • Graphics
  • Host Computers
  • Inclusions
  • Numbers
  • Polygons
  • Triangles
  • Triangulation

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.