<div>If you are fortunate your input data sets will have ID's that you can use to establish the correspondance between the two. Using the ID's to find and compare like cells/points would result in a much faster algorithm than would recovering the correspondance manually as Paul suggests.</div>
<div><br clear="all">David E DeMarle<br>Kitware, Inc.<br>R&D Engineer<br>28 Corporate Drive<br>Clifton Park, NY 12065-8662<br>Phone: 518-371-3971 x109<br><br><br></div>
<div class="gmail_quote">On Mon, Oct 5, 2009 at 3:17 AM, Paul Edwards <span dir="ltr"><<a href="mailto:paul.m.edwards@gmail.com">paul.m.edwards@gmail.com</a>></span> wrote:<br>
<blockquote style="BORDER-LEFT: #ccc 1px solid; MARGIN: 0px 0px 0px 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote">Hi Bastil,<br><br>I did something similar where I was calculating the wall distance for a volume. You can create a filter that takes two inputs. First build a vtkCellLocator with one input. Then iterator over the points in the other input and use the FindClosestPoint method.<br>
<br>Note: this is quite slow.<br><br>Regards,<br>Paul<br><br><br>
<div class="gmail_quote">2009/10/4 <a href="mailto:Bastil2001@yahoo.de" target="_blank">Bastil2001@yahoo.de</a> <span dir="ltr"><<a href="mailto:Bastil2001@yahoo.de" target="_blank">Bastil2001@yahoo.de</a>></span>
<div>
<div></div>
<div class="h5"><br>
<blockquote style="BORDER-LEFT: rgb(204,204,204) 1px solid; MARGIN: 0pt 0pt 0pt 0.8ex; PADDING-LEFT: 1ex" class="gmail_quote">True. However, I have no 1:1 correspondance since geometries have<br>certain areas where they differ. I guess I need some kind of octree<br>
tocalculate distance....<br><br>Regards BastiL<br><br><a href="mailto:dave.demarle@kitware.com" target="_blank">dave.demarle@kitware.com</a> schrieb:<br>
<div>
<div></div>
<div>> Assuming the topology is the same and a 1:1 correspondance between the two, it would be very easy to do with the python programmable filter.<br>><br>> Script would:<br>> get hold of both input data sets<br>
> copy either to the output data set<br>> make a new point associated double array and add it to the output<br>> make the array 3 components wide<br>> iterate over points<br>> store del x,y,z in output array<br>
><br>> See the paraview wiki for examples that get0you 90% of the way there.<br>> -----Original Message-----<br>><br>> From: BastiL2001 <<a href="mailto:bastil2001@yahoo.de" target="_blank">bastil2001@yahoo.de</a>><br>
> Subj: Re: [Paraview] Distance visualisation<br>> Date: Sun Oct 4, 2009 9:12 am<br>> Size: 1K<br>> To: Berk Geveci <<a href="mailto:berk.geveci@kitware.com" target="_blank">berk.geveci@kitware.com</a>><br>
> cc: <a href="mailto:paraview@paraview.org" target="_blank">paraview@paraview.org</a><br>><br>> Ok it is lets say the "normal distance" between the elements. These two meshes represents two geometries which are very simular and I simply want to visualise where and how much the geometries differ....<br>
><br>> Regards.<br>><br>><br>><br>><br>> How do you define distance?<br>><br>> On Sun, Oct 4, 2009 at 9:04 AM, BastiL2001 <<a href="mailto:bastil2001@yahoo.de" target="_blank">bastil2001@yahoo.de</a>> wrote:<br>
><br>>> Dear all,<br>>><br>>> I am currently looking for a way to visualise the distance between two unstructured 2D-grids. This means I would need a scalar field with the distance between the two grids which I want to visualise as a contour of one of the two grids.<br>
>> Is there a way in Paraview to create this "distance" scalar field? Thanks.<br>>><br>>> BastiL<br>>><br>>><br>>> __________________________________________________<br>>> Do You Yahoo!?<br>
>> Sie sind Spam leid? Yahoo! Mail verfügt über einen herausragenden Schutz gegen Massenmails.<br>>> <a href="http://mail.yahoo.com/" target="_blank">http://mail.yahoo.com</a><br>>> _______________________________________________<br>
>> Powered by <a href="http://www.kitware.com/" target="_blank">www.kitware.com</a><br>>><br>>> Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
>><br>>> Please keep messages on-topic and check the ParaView Wiki at: <a href="http://paraview.org/Wiki/ParaView" target="_blank">http://paraview.org/Wiki/ParaView</a><br>>><br>>> Follow this link to subscribe/unsubscribe:<br>
>> <a href="http://www.paraview.org/mailman/listinfo/paraview" target="_blank">http://www.paraview.org/mailman/listinfo/paraview</a><br>>><br>>><br>><br>><br>><br>><br>> _______________________________________________<br>
> Powered by <a href="http://www.kitware.com/" target="_blank">www.kitware.com</a><br>><br>> Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
><br>> Please keep messages on-topic and check the ParaView Wiki at: <a href="http://paraview.org/Wiki/ParaView" target="_blank">http://paraview.org/Wiki/ParaView</a><br>><br>> Follow this link to subscribe/unsubscribe:<br>
> <a href="http://www.paraview.org/mailman/listinfo/paraview" target="_blank">http://www.paraview.org/mailman/listinfo/paraview</a><br>><br>> --- message truncated ---<br>><br>><br>><br><br>_______________________________________________<br>
Powered by <a href="http://www.kitware.com/" target="_blank">www.kitware.com</a><br><br>Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
<br>Please keep messages on-topic and check the ParaView Wiki at: <a href="http://paraview.org/Wiki/ParaView" target="_blank">http://paraview.org/Wiki/ParaView</a><br><br>Follow this link to subscribe/unsubscribe:<br><a href="http://www.paraview.org/mailman/listinfo/paraview" target="_blank">http://www.paraview.org/mailman/listinfo/paraview</a><br>
</div></div></blockquote></div></div></div><br></blockquote></div><br>