Algorithms and File Structures for Computational Geometry.

Abstract

Algorithms for solving geometric problems and file structures for storing large amounts of geometric data are of increasing importance in computer graphics and computer-aided design. As examples of recent progress in computational geometry, the authors explain plane-sweep algorithms, which solve various topological and geometric problems efficiently; and we present the grid file, an adaptable, symmetric multi-key file structure that provides efficient access to multi-dimensional data along any space dimension. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA144381

Entities

People

  • J. Nievergelt

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Graphics
  • Computer Programming
  • Computer-Aided Design
  • Computers
  • Databases
  • Directories
  • Geometry
  • Graphical User Interface
  • Graphics
  • Grids
  • Intervals
  • Personal Computers
  • Programming Languages
  • Three Dimensional
  • Two Dimensional
  • Very Large Scale Integration

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design

Technology Areas

  • Space