• DocumentCode
    2366463
  • Title

    Optimal parallel all-nearest-neighbors using the well-separated pair decomposition

  • Author

    Callahan, Paul B.

  • Author_Institution
    Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
  • fYear
    1993
  • fDate
    3-5 Nov 1993
  • Firstpage
    332
  • Lastpage
    340
  • Abstract
    We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in Rd. We show how this leads to a deterministic optimal O(log n) time parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parallel algorithms
  • Keywords
    computational geometry; parallel algorithms; k nearest neighbors; optimal parallel all-nearest-neighbors; pair decomposition; point set; well-separated pair decomposition; Binary trees; Computational geometry; Computational modeling; Computer science; Concurrent computing; Nearest neighbor searches; Parallel algorithms; Phase change random access memory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
  • Conference_Location
    Palo Alto, CA
  • Print_ISBN
    0-8186-4370-6
  • Type

    conf

  • DOI
    10.1109/SFCS.1993.366854
  • Filename
    366854
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2366463