<html>
Hi Sagi-<br>
<br>
If you want to do stuff like this I recommend that you study vtkDecimate
and vtkDecimatePro for efficient local operation on vtkPolyData.<br>
<br>
Will<br>
<br>
At 11:21 AM 9/18/2002 +0200, sagi schein wrote:<br>
<br>
<blockquote type=cite class=cite cite><font face="arial" size=2>I am
running into problems when using vtkPolyData in the following
manner.<br>
</font><br>
<font face="arial" size=2>1. There is an initial stage where I read
points / cells and build a poly mash<br>
</font><br>
<font face="arial" size=2>2. In a later stage I need to add points and
update cell structure accordingly. The algorithm basically takes a cell,
and according to some criterion decides to split it. It then generates a
new point and creates two triangles from the single triangle it had
earlier.<br>
</font><br>
<font face="arial" size=2>3. At start I added points and using
InsertNextCells() to add new cells and ReplaceCell() to change old one.
It did not work until I added a DeleteLinks() call and then BuildLinks().
After that everything went ok but for all practical sized mashes it takes
too much. The bottle neck lies in the call for DeleteLinks().<br>
</font><br>
<font face="arial" size=2>4. After that I tried to use ReplaceLinkedCell
and InsertNextLinkCell() but got memory assertions and was not successful
in getting this to work.<br>
</font><br>
<font face="arial" size=2> <br>
</font><br>
<font face="arial" size=2>My basic problem is that I need the ability to
make topological queries on the altered mesh since the algorithm needs to
consider cells that were splitted as well, So I have to make GetCell()
calls on the structure.<br>
</font><br>
<font face="arial" size=2> <br>
</font><br>
<font face="arial" size=2>If anyone has any experience with such a
scenario I could use some help <br>
</font><br>
<font face="arial" size=2>Thanks<br>
</font><br>
<font face="arial" size=2>Sagi Schein<br>
</font><br>
<font face="arial" size=2> </font></blockquote></html>