[vtkusers] Number of points in a KdTree?

[Bill Lorensen]

The purpose of  BuildLocatorFromPoints is described in the header. I
suspect that if you use this method, you cannot get the information
that you want.

//     For the purpose of removing duplicate points quickly from large
//     data sets, or for finding nearby points, we added another mode for
//     building the locator.  BuildLocatorFromPoints will build a k-d tree
//     from one or more vtkPoints objects.  This can be followed by
//     BuildMapForDuplicatePoints which returns a mapping from the original
//     ids to a subset of the ids that is unique within a supplied
//     tolerance, or you can use FindPoint and FindClosestPoint to
//     locate points in the original set that the tree was built from.

On Mon, Oct 26, 2009 at 4:40 PM, David Doria <daviddoria+vtk at gmail.com> wrote:
> On Mon, Oct 26, 2009 at 4:34 PM, Bill Lorensen <bill.lorensen at gmail.com> wrote:
>> I think the problem is that there is not a dataset associated with the
>> kdtree if you build it from points.
>>
>> If you build it from a dataset, there will probably be a dataset.
>>
>> Just a guess...
>
>
> I see the AddDataSet function - so I guess if I had used that followed
> by BuildLocator() I could then use the GetDataSet* style functions. I,
> however, used BuildLocatorFromPoints(). How would one get information
> about that data set if this method was used to build the tree?
>
> Thanks,
>
> David
> _______________________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html
>
> Please keep messages on-topic and check the VTK FAQ at: http://www.vtk.org/Wiki/VTK_FAQ
>
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers
>