[Dune] [#474] Complexity of VTKwriter

[Dune]

THIS IS AN AUTOMATED MESSAGE, DO NOT REPLY.

The following task has a new comment added:

FS#474 - Complexity of VTKwriter
User who did this - Anton Schiela (schiela)

----------
I'm using UG (2-dimensional), serial code. My largest example (12 hour to write out)
had about 5 000 000 triangles with quite strong local refinement. My guess is that
somewhere in the writer there is a facility with higher than linear complexity. Is
there, for example, some map-lookup present in the code at every vertex? A candidate
might be the VertexIterator. It seems to do some kind of look-up. But I do not
understand the code so deeply to be sure.
The problem with test examples is of course, that this only becomes visible in a large problem
perhaps with deep local refinement. The code that produces this grid is also quite
complex, let's see if I can boil it down somehow, but I cannot promise a small test example now.  
I can send you a smaller grid (11 MB,~ 135 000 vertices), which took about 5-6 minutes to write out,
just to get an impression.
----------

More information can be found at the following URL:
http://www.dune-project.org/flyspray/index.php?do=details&task_id=474#comment685

You are receiving this message because you have requested it from the Flyspray bugtracking system.  If you did not expect this message or don't want to receive mails in future, you can change your notification settings at the URL shown above.