• DocumentCode
    535946
  • Title

    The K-nearest neighbor fast searching algorithm of scattered data

  • Author

    Gejun, Zhu ; Changsheng, Ma ; Feng, Xie

  • Author_Institution
    Dept. of Inf. Eng., Changzhou Inst. of Mechatron. Technol., Changzhou, China
  • Volume
    1
  • fYear
    2010
  • fDate
    9-10 Oct. 2010
  • Firstpage
    125
  • Lastpage
    128
  • Abstract
    The paper has put forward an improved K-nearest searching algorithm of scattered data, which is significant to the technology of surface recreate of reverse engineering. Firstly, the initial segmentation of point cloud space is made by adopting the traditional block algorithm, and then estimates the average dot pitch of point cloud. Re-divide the point cloud space according to average dot pitch. The block result decreases the searching range of k-nearest neighbor searching algorithm.
  • Keywords
    data handling; data visualisation; image segmentation; learning (artificial intelligence); reverse engineering; K-nearest neighbor fast searching algorithm; block algorithm; point cloud space segmentation; reverse engineering; scattered data; visualization field; Mice; k-nearest neighbor; point cloud; space partition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Future Information Technology and Management Engineering (FITME), 2010 International Conference on
  • Conference_Location
    Changzhou
  • Print_ISBN
    978-1-4244-9087-5
  • Type

    conf

  • DOI
    10.1109/FITME.2010.5655716
  • Filename
    5655716