Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Model simplification using vertex-clustering
Proceedings of the 1997 symposium on Interactive 3D graphics
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Efficient compression of non-manifold polygonal meshes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
Efficient adaptive simplification of massive meshes
Proceedings of the conference on Visualization '01
A multiphase approach to efficient surface simplification
Proceedings of the conference on Visualization '02
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Parallel Model Simplification of Very Large Polygonal Meshes
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
VIS '93 Proceedings of the 4th conference on Visualization '93
| Hi-index | 0.00 |
As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity workstations, a viable approach to simplifying such models is parallel mesh simplification algorithms. A naïve approach that divides the model into a number of equally sized chunks and distributes them to a number of potentially heterogeneous workstations is bound to fail. In severe cases the computation becomes virtually impossible due to significant slow downs because of memory thrashing. We present a general parallel framework for simplification of very large meshes. This framework ensures a near optimal utilization of the computational resources in a cluster of workstations by providing an intelligent partitioning of the model. This partitioning ensures a high quality output, low runtime due to intelligent load balancing, and high parallel efficiency by providing total memory utilization of each machine, thus guaranteeing not to trash the virtual memory system. To test the usability of our framework we have implemented a parallel version of R-Simp [Brodsky and Watson 2000].