[vtkusers] can vtk visualize 7.2G data set?

[Will Schroeder]

Here's another idea: use vtkSliceCubes which operates on just a few slices 
at a time and produces a marching cubes file...you may have to write out 
several files. Then use vtkQuadricClustering, which is set up to make 
multiple passes over the data using the StartAppend, Append, and EndAppend 
methods. Each pass can read a separate data file and process it.
Will

At 10:54 AM 1/15/2002 -0500, Lisa S. Avila wrote:
>Hello Plato,
>
>You can write a program that processes your data 10 slices at a time (a 
>very manageable 720MB as long as you have enough RAM). You can then append 
>these polygonal data sets together. If they are too big, then you can 
>decimate each of them (while preserving the edges) then glue them together 
>and decimate the final structure.
>
>Lisa
>
>
>At 01:59 AM 1/15/2002, platogao wrote:
>>I have to visualize a Industrial CT data set under Windows2000: each 
>>slice is 6000*6000*2 byte, at list 100 slices. That is: the data quantity 
>>is at least 7.2G !!!
>>I want to use surface rendering algorithms. It's sure that 
>>vtkMarchingCubes or other ordinary filters cannot serve this purpose. All 
>>the data cannot be loaded to RAM at one time, for the memory limitation 
>>of windows program is 4G.
>>
>>How can I sovle this problem?
>>Is vtk a ideal solution for this goal?
>>Should I use OpenGL to program from the very beginning if vtk is not 
>>possible?
>>
>>Please help me.Any of your advise is highly appriciated.
>>
>>Plato Gao
>
>_______________________________________________
>This is the private VTK discussion list. Please keep messages on-topic. 
>Check the FAQ at: <http://public.kitware.com/cgi-bin/vtkfaq>
>Follow this link to subscribe/unsubscribe:
>http://public.kitware.com/mailman/listinfo/vtkusers