common/vtkPointLocator2D.h Source File

00001 /*=========================================================================
00002 
00003   Program:   Visualization Toolkit
00004   Module:    $RCSfile: vtkPointLocator2D.h,v $
00005   Language:  C++
00006 
00007 
00008 Copyright (c) 1993-2001 Ken Martin, Will Schroeder, Bill Lorensen 
00009 All rights reserved.
00010 
00011 Redistribution and use in source and binary forms, with or without
00012 modification, are permitted provided that the following conditions are met:
00013 
00014  * Redistributions of source code must retain the above copyright notice,
00015    this list of conditions and the following disclaimer.
00016 
00017  * Redistributions in binary form must reproduce the above copyright notice,
00018    this list of conditions and the following disclaimer in the documentation
00019    and/or other materials provided with the distribution.
00020 
00021  * Neither name of Ken Martin, Will Schroeder, or Bill Lorensen nor the names
00022    of any contributors may be used to endorse or promote products derived
00023    from this software without specific prior written permission.
00024 
00025  * Modified source versions must be plainly marked as such, and must not be
00026    misrepresented as being the original software.
00027 
00028 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
00029 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00030 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00031 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
00032 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00033 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
00034 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00035 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
00036 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
00037 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00038 
00039 =========================================================================*/
00071 #ifndef __vtkPointLocator2D_h
00072 #define __vtkPointLocator2D_h
00073 
00074 #include "vtkLocator.h"
00075 #include "vtkPoints.h"
00076 #include "vtkIdList.h"
00077 
00078 class vtkNeighborPoints;
00079 
00080 class VTK_EXPORT vtkPointLocator2D : public vtkLocator
00081 {
00082 public:
00085   static vtkPointLocator2D *New();
00086 
00087   vtkTypeMacro(vtkPointLocator2D,vtkLocator);
00088   void PrintSelf(ostream& os, vtkIndent indent);
00089 
00091   vtkSetVector2Macro(Divisions,int);
00092   vtkGetVectorMacro(Divisions,int,2);
00093 
00095   vtkSetClampMacro(NumberOfPointsPerBucket,int,1,VTK_LARGE_INTEGER);
00096   vtkGetMacro(NumberOfPointsPerBucket,int);
00097 
00099   virtual int FindClosestPoint(float x[2]);
00100 
00104   virtual int IsInsertedPoint(float x[2]);
00105 
00110   virtual void FindClosestNPoints(int N, float x[2], vtkIdList *result);
00111   virtual void FindClosestNPoints(int N, float x, float y,
00112               vtkIdList *result);
00113 
00117   virtual void FindDistributedPoints(int N, float x[2], 
00118                  vtkIdList *result, int M);
00119   virtual void FindDistributedPoints(int N, float x, float y, 
00120                  vtkIdList *result, int M);
00121 
00124   virtual void FindPointsWithinRadius(float R, float x[2], vtkIdList *result);
00125   virtual void FindPointsWithinRadius(float R, float x, float y,
00126                   vtkIdList *result);
00128   void Initialize();
00129   void FreeSearchStructure();
00130   void BuildLocator();
00131   void GenerateRepresentation(int level, vtkPolyData *pd);
00132 
00134   vtkSetObjectMacro(Points,vtkPoints);
00135   vtkGetObjectMacro(Points,vtkPoints);
00136   
00137 protected:
00138   vtkPointLocator2D();
00139   ~vtkPointLocator2D();
00140   vtkPointLocator2D(const vtkPointLocator2D&) {};
00141   void operator=(const vtkPointLocator2D&) {};
00142 
00143   // place points in appropriate buckets
00144   void GetBucketNeighbors(int ijk[2], int ndivs[2], int level);
00145   void GetOverlappingBuckets(float x[2], int ijk[2], float dist, int level);
00146   void GenerateFace(int face, int i, int j, int k, 
00147                     vtkPoints *pts, vtkCellArray *polys);
00148 
00149   vtkPoints *Points; // Used for merging points
00150   int Divisions[2]; // Number of sub-divisions in x-y-z directions
00151   int NumberOfPointsPerBucket; //Used with previous boolean to control subdivide
00152   float Bounds[4]; // bounds of points
00153   vtkIdList **HashTable; // lists of point ids in buckets
00154   int NumberOfBuckets; // total size of hash table
00155   float H[2]; // width of each bucket in x-y-z directions
00156   vtkNeighborPoints *Buckets;
00157   float InsertionTol2;
00158 };
00159 
00160 #endif
00161 
00162