[vtkusers] Points inside a Volume

Alex Southern aps at tml.hut.fi
Sun Aug 15 17:09:38 EDT 2010


  The polydata comes from a closed volume of triangles.

BR
A.

On 16/08/2010 00:06, Bill Lorensen wrote:
> Is the polydata derived from a image/volume?
>
>
> On Sun, Aug 15, 2010 at 4:54 PM, Alex Southern<aps at tml.hut.fi>  wrote:
>>   Hi Bill,
>>
>> I've thought about it a bit and i'm not quite sure what your getting at, is
>> the answer staring me in the face? :D
>>
>> A.
>>
>>
>>
>> On 15/08/2010 23:45, Bill Lorensen wrote:
>>> What is the source of the polydata?
>>>
>>> This is a trick question...
>>>
>>> Bill
>>>
>>> On Sat, Aug 14, 2010 at 7:28 AM, Alex Southern<aps at tml.hut.fi>    wrote:
>>>> Hi,
>>>>
>>>> I've asked a similar question here before but Im going to ask it again
>>>> slightly differently.
>>>>
>>>> Using VTK, What is the fastest way to find all points in a grid, (or all
>>>> cubes if you think of it a another way),  that fit inside an arbitrary
>>>> shaped volume of polydata?
>>>>
>>>> I tried vtkEnclosedPoints, it works but its very slow. Someone did
>>>> suggest
>>>> to me using templates does this ring any bells?
>>>>
>>>> Thanks
>>>> Alex
>>>> _______________________________________________
>>>> 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
>>>>
>> _______________________________________________
>> 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
>>




More information about the vtkusers mailing list