• DocumentCode
    3061773
  • Title

    Data-parallel primitives for spatial operations using PM quadtrees

  • Author

    Heol, E.G. ; Samet, Hanan

  • Author_Institution
    Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
  • fYear
    1995
  • fDate
    18-20 Sep 1995
  • Firstpage
    266
  • Lastpage
    273
  • Abstract
    Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these two data structures that make use of these primitives. The data-parallel algorithms are assumed to be main-memory resident. They were implemented on a Thinking Machines CM-5 with 32 processors containing 1 GB of main memory
  • Keywords
    parallel algorithms; quadtrees; spatial data structures; 1 GB; PM quadtrees; PM1 quadtree; Thinking Machines CM-5; bucket PMR quadtree; data structures; data-parallel primitives; main-memory resident data-parallel algorithms; scan model; spatial operations; Application software; Automation; Buildings; Computational modeling; Computer science; Computer vision; Concurrent computing; Data structures; Educational institutions; Image processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95
  • Conference_Location
    Como
  • Print_ISBN
    0-8186-7134-3
  • Type

    conf

  • DOI
    10.1109/CAMP.1995.521049
  • Filename
    521049
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3061773