Computing Minimal Distances on Arbitrary Polyhedral Surfaces

Abstract

We have implemented an algorithm that makes iterative use of the law of cosines to find all the minimal (geodesic) distances in an arbitrary (that is, non-convex) three-dimensional polyhedral surface. The algorithm is intrinsically parallel, inasmuch as it deals with all nodes simultaneously. It has let us obtain very satisfactory flattening of biological (monkey visual cortex) surfaces consisting of several thousand triangular faces, by providing a full characterization of the distance geometry of these surfaces. (KR)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA210015

Entities

People

  • Eric M. Schwartz

Organizations

  • New York University

Tags

Communities of Interest

  • Air Platforms
  • Biomedical

DTIC Thesaurus Topics

  • Brain
  • Computational Neuroscience
  • Computations
  • Computer Graphics
  • Computer Science
  • Computers
  • Dihedral Angle
  • Geometry
  • Neurosciences
  • New York
  • Polygons
  • Psychiatry
  • Robotics
  • Three Dimensional
  • Trees (Data Structures)
  • Triangles
  • Universities

Readers

  • Electromagnetic Wave Scattering and Antenna Radiation Engineering
  • Neural Network Machine Learning.
  • Neuroscience