of Local Model Reference Data Querying for Scattered Points
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A new algorithm of local model reference data querying for the scattered points based on the R*-tree was proposed, which contains four steps: first, the spatial index structure of scattered points was constructed based on the R*-tree; second, a hollow sphere was initialized according to the leaf node including current sample point; third, points in hollow sphere were caught with depth-first searching algorithm; forth, the local model reference data querying was realized through dynamic enlarge hollow sphere, and which is proved that it has strong adaptability of data type, improves the accuracy and efficiency of local model reference data querying for scattered points by examples.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code