src/meshTools/octree/octreeDataPointTreeLeaf.C

   1 /*---------------------------------------------------------------------------*\
   2   =========                 |
   3   \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   4    \\    /   O peration     |
   5     \\  /    A nd           | Copyright (C) 2004-2010 OpenCFD Ltd.
   6      \\/     M anipulation  |
   7 -------------------------------------------------------------------------------
   8 License
   9     This file is part of OpenFOAM.
  10
  11     OpenFOAM is free software: you can redistribute it and/or modify it
  12     under the terms of the GNU General Public License as published by
  13     the Free Software Foundation, either version 3 of the License, or
  14     (at your option) any later version.
  15
  16     OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
  17     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  18     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  19     for more details.
  20
  21     You should have received a copy of the GNU General Public License
  22     along with OpenFOAM.  If not, see <http://www.gnu.org/licenses/>.
  23
  24 \*---------------------------------------------------------------------------*/
  25
  26 //#include "octreeDataPointTreeLeaf.H"
  27 #include "octreeDataPoint.H"
  28 #include "treeLeaf.H"
  29
  30 // * * * * * * * * * * * * * Template Specialisations  * * * * * * * * * * * //
  31
  32 template<>
  33 Foam::label Foam::treeLeaf<Foam::octreeDataPoint>::find
  34 (
  35     const octreeDataPoint& shapes,
  36     const point& sample
  37 ) const
  38 {
  39     notImplemented
  40     (
  41         "Foam::treeLeaf<Foam::octreeDataPoint>::find("
  42         "const octreeDataPoint& shapes,"
  43         "const point& sample"
  44     );
  45
  46     return false;
  47 }
  48
  49
  50 template<>
  51 bool Foam::treeLeaf<Foam::octreeDataPoint>::findNearest
  52 (
  53     const octreeDataPoint& shapes,
  54     const point& sample,
  55     treeBoundBox& tightest,
  56     label& tightestI,
  57     scalar& tightestDist
  58 ) const
  59 {
  60     // Some aliases
  61     const pointField& points = shapes.points();
  62     point& tMin = tightest.min();
  63     point& tMax = tightest.max();
  64
  65     scalar minDist2 = sqr(tightestDist);
  66
  67     label minIndex = -1;
  68     forAll(indices_, i)
  69     {
  70         label pointi = indices_[i];
  71         scalar dist = magSqr(points[pointi] - sample);
  72
  73         if (dist < minDist2)
  74         {
  75             minDist2 = dist;
  76             minIndex = pointi;
  77         }
  78     }
  79
  80     if (minIndex != -1)
  81     {
  82         tightestDist = sqrt(minDist2);
  83
  84         // New nearer. Update 'tightest' bounding box
  85         tMin.x() = sample.x() - tightestDist;
  86         tMin.y() = sample.y() - tightestDist;
  87         tMin.z() = sample.z() - tightestDist;
  88
  89         tMax.x() = sample.x() + tightestDist;
  90         tMax.y() = sample.y() + tightestDist;
  91         tMax.z() = sample.z() + tightestDist;
  92
  93         tightestI = minIndex;
  94
  95         return true;
  96     }
  97     else
  98     {
  99         // New no nearer so nothing changed
 100         return false;
 101     }
 102 }
 103
 104
 105 // ************************************************************************* //