The Mean Distance in 2-Space,

Abstract

An O(N squared) lower bound is proven for the mean distance between N points in 2-space, using methods from complex function theory; but if any finite error is allowed, an O(N log N) algorithm is shown for computing the mean distance to within that finite error.

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA029134

Entities

People

  • G. Yuval

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms

Readers

  • Approximation Theory.
  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space