Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Application-controlled demand paging for out-of-core visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Smooth view-dependent level-of-detail control and its application to terrain rendering
Proceedings of the conference on Visualization '98
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
XFastMesh: fast view-dependent meshing from external memory
Proceedings of the conference on Visualization '02
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
A Multiresolution Representation for Massive Meshes
IEEE Transactions on Visualization and Computer Graphics
Quick-VDR: Out-of-Core View-Dependent Rendering of Gigantic Models
IEEE Transactions on Visualization and Computer Graphics
ACM SIGGRAPH 2005 Papers
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Triangle order optimization for graphics hardware computation culling
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Real-time mesh simplification using the GPU
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Hi-index | 0.00 |
Large meshes are becoming commonplace with the advance of 3D scanning, scientific simulation and CAD technology. While there are many algorithms proposed to simplify these large meshes, the time of simplification process is usually very long, especially for those algorithms based on iterative edge collapse. To address this problem, we propose two parallel schemes to speed up simplifying large meshes on a PC cluster. The first parallel simplification scheme partitions a large mesh into small sub-meshes, simplifies these sub-meshes in parallel in an in-core way and finally stitches the simplified versions together. The second scheme generates multiple mesh streams, applies stream simplification to them in parallel in an out-of-core way, and composes the final simplified mesh streams. We have implemented these two parallel simplification schemes and the experimental results show that our methods are able to speed up the iterative simplification of large meshes by a factor of 8 to 19 on a cluster of 24 PCs.