<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>VTK: vtkAbstractCellLocator Class Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="classes.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="classes.html"><span>Alphabetical List</span></a></li>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>vtkAbstractCellLocator Class Reference</h1><!-- doxytag: class="vtkAbstractCellLocator" --><!-- doxytag: inherits="vtkLocator" --><code>#include <<a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for vtkAbstractCellLocator:</div>
<div class="dynsection">
<p><center><img src="a07753.png" border="0" usemap="#a07754" alt="Inheritance graph"></center>
<map name="a07754">
<area shape="rect" href="a00250.html" title="octree-based spatial search object to quickly locate cells" alt="" coords="5,304,115,331"><area shape="rect" href="a01083.html" title="generate oriented bounding box (OBB) tree" alt="" coords="139,304,235,331"><area shape="rect" href="a00971.html" title="abstract base class for objects that accelerate spatial searches" alt="" coords="80,155,165,181"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="83,80,163,107"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="68,5,177,32"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for vtkAbstractCellLocator:</div>
<div class="dynsection">
<p><center><img src="a07755.png" border="0" usemap="#a07756" alt="Collaboration graph"></center>
<map name="a07756">
<area shape="rect" href="a00971.html" title="abstract base class for objects that accelerate spatial searches" alt="" coords="2447,283,2532,310"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="444,519,524,546"><area shape="rect" href="a00362.html" title="general representation of visualization data" alt="" coords="1772,656,1879,683"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="1056,347,1155,374"><area shape="rect" href="a00472.html" title="Superclass for all pipeline executives in VTK." alt="" coords="1459,440,1557,467"><area shape="rect" href="a00895.html" title="Store zero or more vtkInformation instances." alt="" coords="675,432,824,459"><area shape="rect" href="a00872.html" title="Store vtkAlgorithm input/output information." alt="" coords="695,830,804,856"><area shape="rect" href="a00538.html" title="represent and manipulate fields of data" alt="" coords="1459,711,1557,738"><area shape="rect" href="a00081.html" title="Abstract superclass for all arrays." alt="" coords="1044,798,1167,824"><area shape="rect" href="a00240.html" title="abstract class to specify cell behavior" alt="" coords="2028,174,2092,200"><area shape="rect" href="a01250.html" title="represent and manipulate 3D points" alt="" coords="1787,120,1864,147"><area shape="rect" href="a01513.html" title="map scalar values into colors" alt="" coords="1239,924,1380,951"><area shape="rect" href="a00720.html" title="list of point or cell ids" alt="" coords="880,179,952,206"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="7,1059,116,1086"><area shape="rect" href="a00884.html" title="internal structure for vtkInformation" alt="" coords="403,1076,565,1103"><area shape="rect" href="a00886.html" title="Superclass for vtkInformation keys." alt="" coords="169,1120,300,1147"><area shape="rect" href="a01719.html" title="record modification and/or execution time" alt="" coords="180,680,289,707"><area shape="rect" href="a00374.html" title="abstract class to specify dataset behavior" alt="" coords="2247,770,2335,796"><area shape="rect" href="a01574.html" title="abstract class specifies interface for visualization network source" alt="" coords="2249,560,2332,587"><area shape="rect" href="a00980.html" title="map scalar values into colors via a lookup table" alt="" coords="2001,914,2119,940"><area shape="rect" href="a01306.html" title="abstract class specifies interface for visualization filters" alt="" coords="1996,476,2124,503"><area shape="rect" href="a00891.html" title="Key for pointer to pointer." alt="" coords="393,1134,575,1160"><area shape="rect" href="a00376.html" title="represent and manipulate attribute data in a dataset" alt="" coords="1752,774,1899,800"><area shape="rect" href="a00356.html" title="abstract superclass for arrays of numeric data" alt="" coords="1457,871,1559,898"><area shape="rect" href="a00540.html" title="vtkFieldData::CopyFieldFlag" alt="" coords="1008,747,1203,774"><area shape="rect" href="a00245.html" title="represent and manipulate cell attribute data" alt="" coords="2013,820,2107,847"><area shape="rect" href="a01242.html" title="represent and manipulate point attribute data" alt="" coords="2009,770,2111,796"><area shape="rect" href="a00539.html" title="vtkFieldData::BasicIterator" alt="" coords="1416,820,1600,847"><area shape="rect" href="a00582.html" title="provides thread-safe access to cells" alt="" coords="2235,210,2347,236"><area shape="rect" href="a01784.html" title="dynamic, self-adjusting array of unsigned char" alt="" coords="1745,830,1905,856"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="a07757.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>
an abstract base class for locators which find cells
<p>
<a class="el" href="a00082.html" title="an abstract base class for locators which find cells">vtkAbstractCellLocator</a> is a spatial search object to quickly locate cells in 3D. <a class="el" href="a00082.html" title="an abstract base class for locators which find cells">vtkAbstractCellLocator</a> supplies a basic interface which concrete subclasses should implement.<p>
<dl class="warning" compact><dt><b>Warning:</b></dt><dd>When deriving a class from <a class="el" href="a00082.html" title="an abstract base class for locators which find cells">vtkAbstractCellLocator</a>, one should include the 'hidden' member functions by the following construct in the derived class <div class="fragment"><pre class="fragment">
//BTX
using vtkAbstractCellLocator::IntersectWithLine;
using vtkAbstractCellLocator::FindClosestPoint;
using vtkAbstractCellLocator::FindClosestPointWithinRadius;
//ETX
</pre></div></dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00971.html" title="abstract base class for objects that accelerate spatial searches">vtkLocator</a> <a class="el" href="a01247.html" title="quickly locate points in 3-space">vtkPointLocator</a> <a class="el" href="a01083.html" title="generate oriented bounding box (OBB) tree">vtkOBBTree</a> <a class="el" href="a00250.html" title="octree-based spatial search object to quickly locate cells">vtkCellLocator</a> </dd></dl>
<p>Definition at line <a class="el" href="a03973.html#l00048">48</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="a00971.html">vtkLocator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#11ac410c62d0e378a5ae32e25fe5014a">Superclass</a></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#29f7f255b5ef21860a56a57d3e44659d">GetClassName</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#4ef6296b5a3285e20697ebd639e54277">IsA</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#af438f1576c1676b6acc42ecf64a11dd">PrintSelf</a> (ostream &os, <a class="el" href="a00869.html">vtkIndent</a> indent)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#80ca9a5b9ea2d808ded7d61609e443fa">FindCellsWithinBounds</a> (double *bbox, <a class="el" href="a00720.html">vtkIdList</a> *cells)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#0c980b5fcf6adcfbf06932185e89defb">FindCell</a> (double x[3])</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#d4847b12d91f03c1a9bd7f186e88c872">InsideCellBounds</a> (double x[3], <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cell_ID)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#4e94ffe4f1a37f05a4626575d39ca280">SetNumberOfCellsPerNode</a> (int)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#a2aacdbf0b94061227cb53c33de8b23e">GetNumberOfCellsPerNode</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#89ff54dabe2ac9beccd8dfc71972d138">SetCacheCellBounds</a> (int)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#18d69e44f7963875db7d981c2221e98a">GetCacheCellBounds</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#c4d92b010c2ee00755caf300538a8001">CacheCellBoundsOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#1e08cdf58363bcd99a6269ad8c4b3050">CacheCellBoundsOff</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#46b0b0c2d63ca52055747883c17f4751">SetRetainCellLists</a> (int)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#e81e14b1ab0fddc709ff201da6af57c1">GetRetainCellLists</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#65bb52945ba13de9049ecb5efee489b1">RetainCellListsOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#4abf6b78955695e4bdcfe89b7a480124">RetainCellListsOff</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#86a256548b94e9e151d72f46287b4a07">SetLazyEvaluation</a> (int)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#07b65be1926be7f5df8d503fa689228c">GetLazyEvaluation</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#1cc2c2ab9499ea557684c2c917467ede">LazyEvaluationOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#17281fe1cbb5af41ce180036015baa4a">LazyEvaluationOff</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#626330cd0e13dca724b9925b27cf97b4">SetUseExistingSearchStructure</a> (int)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#9e1cda218627a0eebe5cc6a27beff462">GetUseExistingSearchStructure</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#2a6a6d56268796c5d4dee7b7f0fea615">UseExistingSearchStructureOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#06f74e8948cd32338aa0c82bed61fb45">UseExistingSearchStructureOff</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#94841c697d05cc9a20f108e8bdfb7235">IntersectWithLine</a> (double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#530ab4bfec97ddbafd05bda400ef6e12">IntersectWithLine</a> (double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#95ad01975080186917a4136b5c2eae1a">IntersectWithLine</a> (double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, <a class="el" href="a00582.html">vtkGenericCell</a> *cell)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#923e1e69dd8b70688f9b101e9aa1c47b">IntersectWithLine</a> (const double a0[3], const double a1[3], <a class="el" href="a01250.html">vtkPoints</a> *points, <a class="el" href="a00720.html">vtkIdList</a> *cellIds)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#2905b926fba483ce5cc8ae55a9e114d5">FindClosestPoint</a> (double x[3], double closestPoint[3], <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, int &subId, double &dist2)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#ec7fa97fdc0dd9a8fb2b2cd5185c8ecd">FindClosestPoint</a> (double x[3], double closestPoint[3], <a class="el" href="a00582.html">vtkGenericCell</a> *cell, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, int &subId, double &dist2)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#ab50afea95c3e0076247b353ed92b341">FindClosestPointWithinRadius</a> (double x[3], double radius, double closestPoint[3], <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, int &subId, double &dist2)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#6dabc0c79eb359cc3512843c4b3d45b2">FindClosestPointWithinRadius</a> (double x[3], double radius, double closestPoint[3], <a class="el" href="a00582.html">vtkGenericCell</a> *cell, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, int &subId, double &dist2)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#9c65fb7d32c648dbb4caeadb62795f8e">FindClosestPointWithinRadius</a> (double x[3], double radius, double closestPoint[3], <a class="el" href="a00582.html">vtkGenericCell</a> *cell, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &cellId, int &subId, double &dist2, int &inside)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#730b8c9fa9f901bc7138b00a3a09677c">FindCellsAlongLine</a> (double p1[3], double p2[3], double tolerance, <a class="el" href="a00720.html">vtkIdList</a> *cells)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#5b87f4f282b4854ddbfbec6630920fa0">FindCell</a> (double x[3], double tol2, <a class="el" href="a00582.html">vtkGenericCell</a> *GenCell, double pcoords[3], double *weights)</td></tr>
<tr><td colspan="2"><br><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#5f1accc60b8e1fe12fa7a9616f781b9f">IsTypeOf</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a00082.html">vtkAbstractCellLocator</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#0a2e69c826fa52b6328e949e06055a68">SafeDownCast</a> (<a class="el" href="a01084.html">vtkObject</a> *o)</td></tr>
<tr><td colspan="2"><br><h2>Protected Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#f598f1a6adfce7b4bc2595c71fb863a9">vtkAbstractCellLocator</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#0433e18309ec4f8792b50bf40be9e35a">~vtkAbstractCellLocator</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#6242f6853a7e05ee8ad4e340204a7dbd">StoreCellBounds</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#99ebb92bad62d1fcea06daf7e3ddc194">FreeCellBounds</a> ()</td></tr>
<tr><td colspan="2"><br><h2>Protected Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#f67224003829025bf87e83e0088a8483">NumberOfCellsPerNode</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#c9c5bd1f1395e96155c095e85cc14d9d">RetainCellLists</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#93309dfb80acf185b3e93b033803828b">CacheCellBounds</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#432d4ebff4ce2ed1340b4b36e3179041">LazyEvaluation</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#6eca6604aeec28c3d3e32428d135665d">UseExistingSearchStructure</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00582.html">vtkGenericCell</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#364cd7fc4d5c4be1564f7ae3ad9bf911">GenericCell</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double(* </td><td class="memItemRight" valign="bottom"><a class="el" href="a00082.html#42d6a6aabdc0b329d425e8b9a298f837">CellBounds</a> )[6]</td></tr>
</table>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="11ac410c62d0e378a5ae32e25fe5014a"></a><!-- doxytag: member="vtkAbstractCellLocator::Superclass" ref="11ac410c62d0e378a5ae32e25fe5014a" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00971.html">vtkLocator</a> <a class="el" href="a00971.html">vtkAbstractCellLocator::Superclass</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a00971.html#fbfe7f8eb9347828b3f0c7e21b8ca00d">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#35101956ffa0df3850b51ff062ab088c">vtkCellLocator</a>, and <a class="el" href="a01083.html#198c50eb604e9a0e3414e5928c75e62f">vtkOBBTree</a>.</p>
<p>Definition at line <a class="el" href="a03973.html#l00051">51</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="f598f1a6adfce7b4bc2595c71fb863a9"></a><!-- doxytag: member="vtkAbstractCellLocator::vtkAbstractCellLocator" ref="f598f1a6adfce7b4bc2595c71fb863a9" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkAbstractCellLocator::vtkAbstractCellLocator </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="0433e18309ec4f8792b50bf40be9e35a"></a><!-- doxytag: member="vtkAbstractCellLocator::~vtkAbstractCellLocator" ref="0433e18309ec4f8792b50bf40be9e35a" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkAbstractCellLocator::~vtkAbstractCellLocator </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="29f7f255b5ef21860a56a57d3e44659d"></a><!-- doxytag: member="vtkAbstractCellLocator::GetClassName" ref="29f7f255b5ef21860a56a57d3e44659d" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual const char* vtkAbstractCellLocator::GetClassName </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a00971.html#1d4ded8a8a4c2293d462fb62abd464e1">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#7a2b15774ecec8c259b8911baca7d71f">vtkCellLocator</a>, and <a class="el" href="a01083.html#71ccf8b3c7496255ad9e69e53122f070">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="5f1accc60b8e1fe12fa7a9616f781b9f"></a><!-- doxytag: member="vtkAbstractCellLocator::IsTypeOf" ref="5f1accc60b8e1fe12fa7a9616f781b9f" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static int vtkAbstractCellLocator::IsTypeOf </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a00971.html#39b97a532f7f6f3a3d78c4142075a965">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#7d4c803bc79421edc3182804b46e9db2">vtkCellLocator</a>, and <a class="el" href="a01083.html#a16a2aa024e320b5e99b2df8b79e23b6">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="4ef6296b5a3285e20697ebd639e54277"></a><!-- doxytag: member="vtkAbstractCellLocator::IsA" ref="4ef6296b5a3285e20697ebd639e54277" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::IsA </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a00971.html#1891c93c797e9a3ca152f00e4f155587">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#6b60ee91a01c276f4df576e914f43469">vtkCellLocator</a>, and <a class="el" href="a01083.html#86f1edb20978c53aabf7f1925d5e4895">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="0a2e69c826fa52b6328e949e06055a68"></a><!-- doxytag: member="vtkAbstractCellLocator::SafeDownCast" ref="0a2e69c826fa52b6328e949e06055a68" args="(vtkObject *o)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00082.html">vtkAbstractCellLocator</a>* vtkAbstractCellLocator::SafeDownCast </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01084.html">vtkObject</a> * </td>
<td class="paramname"> <em>o</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a00971.html#21a594789d2970ed3199ab4378e318d5">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#5aa6b18ed8eba85660416aaf9c7346d9">vtkCellLocator</a>, and <a class="el" href="a01083.html#d7d783713c32403f2f37bdc749ba33b0">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="af438f1576c1676b6acc42ecf64a11dd"></a><!-- doxytag: member="vtkAbstractCellLocator::PrintSelf" ref="af438f1576c1676b6acc42ecf64a11dd" args="(ostream &os, vtkIndent indent)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkAbstractCellLocator::PrintSelf </td>
<td>(</td>
<td class="paramtype">ostream & </td>
<td class="paramname"> <em>os</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00869.html">vtkIndent</a> </td>
<td class="paramname"> <em>indent</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use <a class="el" href="a01085.html#edadf6378465fd81c2592ef64262e2a5">Print()</a> instead) but used in the hierarchical print process to combine the output of several classes.
<p>Reimplemented from <a class="el" href="a00971.html#e8661aa7fe43687556be27eeecd3ae1d">vtkLocator</a>.</p>
<p>Reimplemented in <a class="el" href="a00250.html#64d95ca2f586e4029830722600802dc5">vtkCellLocator</a>, and <a class="el" href="a01083.html#f97a0209a977c25367c13f487f867826">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="4e94ffe4f1a37f05a4626575d39ca280"></a><!-- doxytag: member="vtkAbstractCellLocator::SetNumberOfCellsPerNode" ref="4e94ffe4f1a37f05a4626575d39ca280" args="(int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::SetNumberOfCellsPerNode </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
</div>
</div><p>
<a class="anchor" name="a2aacdbf0b94061227cb53c33de8b23e"></a><!-- doxytag: member="vtkAbstractCellLocator::GetNumberOfCellsPerNode" ref="a2aacdbf0b94061227cb53c33de8b23e" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::GetNumberOfCellsPerNode </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
</div>
</div><p>
<a class="anchor" name="89ff54dabe2ac9beccd8dfc71972d138"></a><!-- doxytag: member="vtkAbstractCellLocator::SetCacheCellBounds" ref="89ff54dabe2ac9beccd8dfc71972d138" args="(int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::SetCacheCellBounds </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
</div>
</div><p>
<a class="anchor" name="18d69e44f7963875db7d981c2221e98a"></a><!-- doxytag: member="vtkAbstractCellLocator::GetCacheCellBounds" ref="18d69e44f7963875db7d981c2221e98a" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::GetCacheCellBounds </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
</div>
</div><p>
<a class="anchor" name="c4d92b010c2ee00755caf300538a8001"></a><!-- doxytag: member="vtkAbstractCellLocator::CacheCellBoundsOn" ref="c4d92b010c2ee00755caf300538a8001" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::CacheCellBoundsOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
</div>
</div><p>
<a class="anchor" name="1e08cdf58363bcd99a6269ad8c4b3050"></a><!-- doxytag: member="vtkAbstractCellLocator::CacheCellBoundsOff" ref="1e08cdf58363bcd99a6269ad8c4b3050" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::CacheCellBoundsOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
</div>
</div><p>
<a class="anchor" name="46b0b0c2d63ca52055747883c17f4751"></a><!-- doxytag: member="vtkAbstractCellLocator::SetRetainCellLists" ref="46b0b0c2d63ca52055747883c17f4751" args="(int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::SetRetainCellLists </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
</div>
</div><p>
<a class="anchor" name="e81e14b1ab0fddc709ff201da6af57c1"></a><!-- doxytag: member="vtkAbstractCellLocator::GetRetainCellLists" ref="e81e14b1ab0fddc709ff201da6af57c1" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::GetRetainCellLists </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
</div>
</div><p>
<a class="anchor" name="65bb52945ba13de9049ecb5efee489b1"></a><!-- doxytag: member="vtkAbstractCellLocator::RetainCellListsOn" ref="65bb52945ba13de9049ecb5efee489b1" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::RetainCellListsOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
</div>
</div><p>
<a class="anchor" name="4abf6b78955695e4bdcfe89b7a480124"></a><!-- doxytag: member="vtkAbstractCellLocator::RetainCellListsOff" ref="4abf6b78955695e4bdcfe89b7a480124" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::RetainCellListsOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
</div>
</div><p>
<a class="anchor" name="86a256548b94e9e151d72f46287b4a07"></a><!-- doxytag: member="vtkAbstractCellLocator::SetLazyEvaluation" ref="86a256548b94e9e151d72f46287b4a07" args="(int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::SetLazyEvaluation </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
</div>
</div><p>
<a class="anchor" name="07b65be1926be7f5df8d503fa689228c"></a><!-- doxytag: member="vtkAbstractCellLocator::GetLazyEvaluation" ref="07b65be1926be7f5df8d503fa689228c" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::GetLazyEvaluation </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
</div>
</div><p>
<a class="anchor" name="1cc2c2ab9499ea557684c2c917467ede"></a><!-- doxytag: member="vtkAbstractCellLocator::LazyEvaluationOn" ref="1cc2c2ab9499ea557684c2c917467ede" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::LazyEvaluationOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
</div>
</div><p>
<a class="anchor" name="17281fe1cbb5af41ce180036015baa4a"></a><!-- doxytag: member="vtkAbstractCellLocator::LazyEvaluationOff" ref="17281fe1cbb5af41ce180036015baa4a" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::LazyEvaluationOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
</div>
</div><p>
<a class="anchor" name="626330cd0e13dca724b9925b27cf97b4"></a><!-- doxytag: member="vtkAbstractCellLocator::SetUseExistingSearchStructure" ref="626330cd0e13dca724b9925b27cf97b4" args="(int)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::SetUseExistingSearchStructure </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase
</div>
</div><p>
<a class="anchor" name="9e1cda218627a0eebe5cc6a27beff462"></a><!-- doxytag: member="vtkAbstractCellLocator::GetUseExistingSearchStructure" ref="9e1cda218627a0eebe5cc6a27beff462" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::GetUseExistingSearchStructure </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase
</div>
</div><p>
<a class="anchor" name="2a6a6d56268796c5d4dee7b7f0fea615"></a><!-- doxytag: member="vtkAbstractCellLocator::UseExistingSearchStructureOn" ref="2a6a6d56268796c5d4dee7b7f0fea615" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::UseExistingSearchStructureOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase
</div>
</div><p>
<a class="anchor" name="06f74e8948cd32338aa0c82bed61fb45"></a><!-- doxytag: member="vtkAbstractCellLocator::UseExistingSearchStructureOff" ref="06f74e8948cd32338aa0c82bed61fb45" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::UseExistingSearchStructureOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase
</div>
</div><p>
<a class="anchor" name="94841c697d05cc9a20f108e8bdfb7235"></a><!-- doxytag: member="vtkAbstractCellLocator::IntersectWithLine" ref="94841c697d05cc9a20f108e8bdfb7235" args="(double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::IntersectWithLine </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a0</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a1</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>tol</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>t</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>pcoords</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return intersection point (if any) of finite line with cells contained in cell locator.
<p>Reimplemented in <a class="el" href="a00250.html#8f46c090c0d24618f50f4475dcd2dfab">vtkCellLocator</a>, and <a class="el" href="a01083.html#e706abdc833e0365444cd2c1df1c8966">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="530ab4bfec97ddbafd05bda400ef6e12"></a><!-- doxytag: member="vtkAbstractCellLocator::IntersectWithLine" ref="530ab4bfec97ddbafd05bda400ef6e12" args="(double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::IntersectWithLine </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a0</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a1</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>tol</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>t</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>pcoords</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return intersection point (if any) AND the cell which was intersected by the finite line.
<p>Reimplemented in <a class="el" href="a00250.html#a9714616d924e860385bee6eb61d3dd9">vtkCellLocator</a>, and <a class="el" href="a01083.html#2b2d9174fa6fac5268b44f57f1ffb005">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="95ad01975080186917a4136b5c2eae1a"></a><!-- doxytag: member="vtkAbstractCellLocator::IntersectWithLine" ref="95ad01975080186917a4136b5c2eae1a" args="(double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::IntersectWithLine </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a0</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>a1</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>tol</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>t</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>pcoords</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00582.html">vtkGenericCell</a> * </td>
<td class="paramname"> <em>cell</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell.
<p>Reimplemented in <a class="el" href="a00250.html#4400cfccf55b6a8f541f7d8514655c4c">vtkCellLocator</a>, and <a class="el" href="a01083.html#338ddd1da9e74fa0fb3c6cc219cbafd8">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="923e1e69dd8b70688f9b101e9aa1c47b"></a><!-- doxytag: member="vtkAbstractCellLocator::IntersectWithLine" ref="923e1e69dd8b70688f9b101e9aa1c47b" args="(const double a0[3], const double a1[3], vtkPoints *points, vtkIdList *cellIds)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkAbstractCellLocator::IntersectWithLine </td>
<td>(</td>
<td class="paramtype">const double </td>
<td class="paramname"> <em>a0</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const double </td>
<td class="paramname"> <em>a1</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01250.html">vtkPoints</a> * </td>
<td class="paramname"> <em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00720.html">vtkIdList</a> * </td>
<td class="paramname"> <em>cellIds</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Take the passed line segment and intersect it with the data set. This method assumes that the data set is a <a class="el" href="a01260.html" title="concrete dataset represents vertices, lines, polygons, and triangle strips">vtkPolyData</a> that describes a closed surface, and the intersection points that are returned in 'points' alternate between entrance points and exit points. The return value of the function is 0 if no intersections were found, -1 if point 'a0' lies inside the closed surface, or +1 if point 'a0' lies outside the closed surface. Either 'points' or 'cellIds' can be set to NULL if you don't want to receive that information. This method is currently only implemented in <a class="el" href="a01083.html" title="generate oriented bounding box (OBB) tree">vtkOBBTree</a>
<p>Reimplemented in <a class="el" href="a00250.html#c4ffaaa00538b9563bc905a2ac5e7087">vtkCellLocator</a>, and <a class="el" href="a01083.html#06ae1aa05a5ba8d88465f9520b4f2de3">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="2905b926fba483ce5cc8ae55a9e114d5"></a><!-- doxytag: member="vtkAbstractCellLocator::FindClosestPoint" ref="2905b926fba483ce5cc8ae55a9e114d5" args="(double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::FindClosestPoint </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>closestPoint</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>dist2</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell.
<p>Reimplemented in <a class="el" href="a00250.html#269f02659220d0fb84480a05c53058ed">vtkCellLocator</a>, and <a class="el" href="a01083.html#02f5f168e82e368d2af372ceddf2a017">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="ec7fa97fdc0dd9a8fb2b2cd5185c8ecd"></a><!-- doxytag: member="vtkAbstractCellLocator::FindClosestPoint" ref="ec7fa97fdc0dd9a8fb2b2cd5185c8ecd" args="(double x[3], double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::FindClosestPoint </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>closestPoint</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00582.html">vtkGenericCell</a> * </td>
<td class="paramname"> <em>cell</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>dist2</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This version takes in a <a class="el" href="a00582.html" title="provides thread-safe access to cells">vtkGenericCell</a> to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a cell is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.
<p>Reimplemented in <a class="el" href="a00250.html#bbd42d8c048a5d72dd1742e6319d782a">vtkCellLocator</a>, and <a class="el" href="a01083.html#afa42c16ca460bc6ec7b652f975abf52">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="ab50afea95c3e0076247b353ed92b341"></a><!-- doxytag: member="vtkAbstractCellLocator::FindClosestPointWithinRadius" ref="ab50afea95c3e0076247b353ed92b341" args="(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkAbstractCellLocator::FindClosestPointWithinRadius </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>radius</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>closestPoint</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>dist2</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined.
<p>Reimplemented in <a class="el" href="a00250.html#3fc98a0100abf9614093f1bee20e2793">vtkCellLocator</a>, and <a class="el" href="a01083.html#4e1cd10d260cf194ff99f5fed1420f26">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="6dabc0c79eb359cc3512843c4b3d45b2"></a><!-- doxytag: member="vtkAbstractCellLocator::FindClosestPointWithinRadius" ref="6dabc0c79eb359cc3512843c4b3d45b2" args="(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkAbstractCellLocator::FindClosestPointWithinRadius </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>radius</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>closestPoint</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00582.html">vtkGenericCell</a> * </td>
<td class="paramname"> <em>cell</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>dist2</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a <a class="el" href="a00582.html" title="provides thread-safe access to cells">vtkGenericCell</a> to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.
<p>Reimplemented in <a class="el" href="a00250.html#505e2a6ee03c3ee6b6e3352e1ee0bad5">vtkCellLocator</a>, and <a class="el" href="a01083.html#65b2a3afae0338ea83e0cc53692431db">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="9c65fb7d32c648dbb4caeadb62795f8e"></a><!-- doxytag: member="vtkAbstractCellLocator::FindClosestPointWithinRadius" ref="9c65fb7d32c648dbb4caeadb62795f8e" args="(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2, int &inside)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkAbstractCellLocator::FindClosestPointWithinRadius </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>radius</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>closestPoint</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00582.html">vtkGenericCell</a> * </td>
<td class="paramname"> <em>cell</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> & </td>
<td class="paramname"> <em>cellId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>subId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double & </td>
<td class="paramname"> <em>dist2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int & </td>
<td class="paramname"> <em>inside</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a <a class="el" href="a00582.html" title="provides thread-safe access to cells">vtkGenericCell</a> to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and dealloction can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit. If a closest point is found, inside returns the return value of the EvaluatePosition call to the closest cell; inside(=1) or outside(=0).
<p>Reimplemented in <a class="el" href="a00250.html#e3ac97de3a4aaafeca3bc040a510ead5">vtkCellLocator</a>, and <a class="el" href="a01083.html#56e332849604ac25f3f666b91f65e0e3">vtkOBBTree</a>.</p>
</div>
</div><p>
<a class="anchor" name="80ca9a5b9ea2d808ded7d61609e443fa"></a><!-- doxytag: member="vtkAbstractCellLocator::FindCellsWithinBounds" ref="80ca9a5b9ea2d808ded7d61609e443fa" args="(double *bbox, vtkIdList *cells)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::FindCellsWithinBounds </td>
<td>(</td>
<td class="paramtype">double * </td>
<td class="paramname"> <em>bbox</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00720.html">vtkIdList</a> * </td>
<td class="paramname"> <em>cells</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return a list of unique cell ids inside of a given bounding box. The user must provide the <a class="el" href="a00720.html" title="list of point or cell ids">vtkIdList</a> to populate. This method returns data only after the locator has been built.
<p>Reimplemented in <a class="el" href="a00250.html#c9ddac6bc043aed3b20952a7d2cdcb7c">vtkCellLocator</a>.</p>
</div>
</div><p>
<a class="anchor" name="730b8c9fa9f901bc7138b00a3a09677c"></a><!-- doxytag: member="vtkAbstractCellLocator::FindCellsAlongLine" ref="730b8c9fa9f901bc7138b00a3a09677c" args="(double p1[3], double p2[3], double tolerance, vtkIdList *cells)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::FindCellsAlongLine </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>p1</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>p2</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>tolerance</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00720.html">vtkIdList</a> * </td>
<td class="paramname"> <em>cells</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the <a class="el" href="a00720.html" title="list of point or cell ids">vtkIdList</a> to populate. This method returns data only after the locator has been built.
<p>Reimplemented in <a class="el" href="a00250.html#9f1012147379c10c60b54ab52bc48dcf">vtkCellLocator</a>.</p>
</div>
</div><p>
<a class="anchor" name="0c980b5fcf6adcfbf06932185e89defb"></a><!-- doxytag: member="vtkAbstractCellLocator::FindCell" ref="0c980b5fcf6adcfbf06932185e89defb" args="(double x[3])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkAbstractCellLocator::FindCell </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3] </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns the Id of the cell containing the point, returns -1 if no cell found. This interface uses a tolerance of zero
</div>
</div><p>
<a class="anchor" name="5b87f4f282b4854ddbfbec6630920fa0"></a><!-- doxytag: member="vtkAbstractCellLocator::FindCell" ref="5b87f4f282b4854ddbfbec6630920fa0" args="(double x[3], double tol2, vtkGenericCell *GenCell, double pcoords[3], double *weights)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkAbstractCellLocator::FindCell </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>tol2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00582.html">vtkGenericCell</a> * </td>
<td class="paramname"> <em>GenCell</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>pcoords</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double * </td>
<td class="paramname"> <em>weights</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Find the cell containing a given point. returns -1 if no cell found the cell parameters are copied into the supplied variables, a cell must be provided to store the information.
</div>
</div><p>
<a class="anchor" name="d4847b12d91f03c1a9bd7f186e88c872"></a><!-- doxytag: member="vtkAbstractCellLocator::InsideCellBounds" ref="d4847b12d91f03c1a9bd7f186e88c872" args="(double x[3], vtkIdType cell_ID)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkAbstractCellLocator::InsideCellBounds </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3], </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>cell_ID</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Quickly test if a point is inside the bounds of a particular cell. Some locators cache cell bounds and this function can make use of fast access to the data.
</div>
</div><p>
<a class="anchor" name="6242f6853a7e05ee8ad4e340204a7dbd"></a><!-- doxytag: member="vtkAbstractCellLocator::StoreCellBounds" ref="6242f6853a7e05ee8ad4e340204a7dbd" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkAbstractCellLocator::StoreCellBounds </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
This command is used internally by the locator to copy all cell Bounds into the internal CellBounds array. Subsequent calls to InsideCellBounds(...) can make use of the data A valid dataset must be present for this to work. Returns true if bounds wre copied, false otherwise.
</div>
</div><p>
<a class="anchor" name="99ebb92bad62d1fcea06daf7e3ddc194"></a><!-- doxytag: member="vtkAbstractCellLocator::FreeCellBounds" ref="99ebb92bad62d1fcea06daf7e3ddc194" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkAbstractCellLocator::FreeCellBounds </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
This command is used internally by the locator to copy all cell Bounds into the internal CellBounds array. Subsequent calls to InsideCellBounds(...) can make use of the data A valid dataset must be present for this to work. Returns true if bounds wre copied, false otherwise.
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="f67224003829025bf87e83e0088a8483"></a><!-- doxytag: member="vtkAbstractCellLocator::NumberOfCellsPerNode" ref="f67224003829025bf87e83e0088a8483" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="a00082.html#f67224003829025bf87e83e0088a8483">vtkAbstractCellLocator::NumberOfCellsPerNode</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00277">277</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c9c5bd1f1395e96155c095e85cc14d9d"></a><!-- doxytag: member="vtkAbstractCellLocator::RetainCellLists" ref="c9c5bd1f1395e96155c095e85cc14d9d" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="a00082.html#c9c5bd1f1395e96155c095e85cc14d9d">vtkAbstractCellLocator::RetainCellLists</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00278">278</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="93309dfb80acf185b3e93b033803828b"></a><!-- doxytag: member="vtkAbstractCellLocator::CacheCellBounds" ref="93309dfb80acf185b3e93b033803828b" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="a00082.html#93309dfb80acf185b3e93b033803828b">vtkAbstractCellLocator::CacheCellBounds</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00279">279</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="432d4ebff4ce2ed1340b4b36e3179041"></a><!-- doxytag: member="vtkAbstractCellLocator::LazyEvaluation" ref="432d4ebff4ce2ed1340b4b36e3179041" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="a00082.html#432d4ebff4ce2ed1340b4b36e3179041">vtkAbstractCellLocator::LazyEvaluation</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00280">280</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="6eca6604aeec28c3d3e32428d135665d"></a><!-- doxytag: member="vtkAbstractCellLocator::UseExistingSearchStructure" ref="6eca6604aeec28c3d3e32428d135665d" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="a00082.html#6eca6604aeec28c3d3e32428d135665d">vtkAbstractCellLocator::UseExistingSearchStructure</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00281">281</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="364cd7fc4d5c4be1564f7ae3ad9bf911"></a><!-- doxytag: member="vtkAbstractCellLocator::GenericCell" ref="364cd7fc4d5c4be1564f7ae3ad9bf911" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00582.html">vtkGenericCell</a>* <a class="el" href="a00082.html#364cd7fc4d5c4be1564f7ae3ad9bf911">vtkAbstractCellLocator::GenericCell</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00282">282</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="42d6a6aabdc0b329d425e8b9a298f837"></a><!-- doxytag: member="vtkAbstractCellLocator::CellBounds" ref="42d6a6aabdc0b329d425e8b9a298f837" args=")[6]" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double(* <a class="el" href="a00082.html#42d6a6aabdc0b329d425e8b9a298f837">vtkAbstractCellLocator::CellBounds</a>)[6]<code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Definition at line <a class="el" href="a03973.html#l00284">284</a> of file <a class="el" href="a03973.html">vtkAbstractCellLocator.h</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li>dox/Filtering/<a class="el" href="a03973.html">vtkAbstractCellLocator.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 18:52:20 2009 for VTK by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
60f1dc962abad0f3b492991a4fbef9be
>
files
>
85
