[Paraview] Delaunay 3D filter too slow

[庞庆源]

This is the source of my test plugin.Could you have a try?
My paraview version is 4.0.1 ,built from source.


2013/9/27 Moreland, Kenneth <kmorel at sandia.gov>

>   I doubt that would make a difference. I just tried a bimodal
> distribution using two point sources, and the filter still executed in
> about the same amount of time.
>
>  So what version of ParaView are you using? Are you using a binary
> downloaded from paraview.org or did you build your own?
>
>  -Ken
>
>   From: 庞庆源 <pangqingyuan1991 at gmail.com>
> Date: Thursday, September 26, 2013 3:05 AM
> To: Kenneth Moreland <kmorel at sandia.gov>
> Cc: "paraview at paraview.org" <paraview at paraview.org>
>
> Subject: [EXTERNAL] Re: [Paraview] Delaunay 3D filter too slow
>
>   My points are not Uniform distribution.They take from intersections of
> 89 wefts and 180 warps.So the points are intensive at poles and sparse at
> equator.Is this the problem?
>
>
> 2013/9/25 Moreland, Kenneth <kmorel at sandia.gov>
>
>>   That is strange. I cannot replicate your problem. I used a point
>> source to create 16020 random points in a sphere, and the Delaunay
>> triangulation took only about 2 seconds. My processor might be a bit better
>> than yours, but not anywhere near enough to explain the difference.
>>
>>  What version of ParaView are you using? Are you a binary downloaded
>> from paraview.org or did you build your own?
>>
>>  -Ken
>>
>>   From: 庞庆源 <pangqingyuan1991 at gmail.com>
>> Date: Tuesday, September 24, 2013 10:29 PM
>> To: Kenneth Moreland <kmorel at sandia.gov>
>> Subject: [EXTERNAL] Re: [Paraview] Delaunay 3D filter too slow
>>
>>   in fact,I have only 16020 points for test.My cpu is AMD Athlon(tm) II
>> P320 Dual-Core Processor with 2.1GHz.How long will it take in this case if
>> I use one cpu to calculate?I have wait for more than 10 minutes before
>> stopping it.
>>
>>
>> 2013/9/24 Moreland, Kenneth <kmorel at sandia.gov>
>>
>>>   Your options are probably either to wait or do something else.
>>> Delaunay triangulation is a pretty heavyweight operation and in general it
>>> is not trivial to impose a topology on a collection of points.
>>>
>>>  You might rethink whether you really need to create a solid sphere in
>>> the first place. I'm guessing you have at least around 100,000 points (or
>>> else Delaunay probably would not be that slow). If you just render these
>>> points as a cloud of points, you should get enough occlusion for it to look
>>> pretty much like a sphere.
>>>
>>>  -Ken
>>>
>>>   From: 庞庆源 <pangqingyuan1991 at gmail.com>
>>> Date: Tuesday, September 24, 2013 5:01 AM
>>> To: paraview <paraview at paraview.org>
>>> Subject: [EXTERNAL] [Paraview] Delaunay 3D filter too slow
>>>
>>>   I have a lot of points taking sample from a solid sphere.So I want to
>>> use Delaunay 3D filter to render the shpere with known scalars of the
>>> points.But it took me so much time.What should I do?
>>>
>>>  --
>>> 庞庆源 <pangqingyuan1991 at gmail.com>
>>>
>>
>>
>>
>>  --
>> 庞庆源 <pangqingyuan1991 at gmail.com>
>>
>
>
>
>  --
> 庞庆源 <pangqingyuan1991 at gmail.com>
>



-- 
庞庆源 <pangqingyuan1991 at gmail.com>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.paraview.org/pipermail/paraview/attachments/20130927/4e69044c/attachment-0001.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: test.tar.gz
Type: application/x-gzip
Size: 93534 bytes
Desc: not available
URL: <http://www.paraview.org/pipermail/paraview/attachments/20130927/4e69044c/attachment-0001.bin>