Vector quantization and signal compression
Vector quantization and signal compression
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
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Compressing large polygonal models
Proceedings of the conference on Visualization '01
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Mesh geometry compression for mobile graphics
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
| Hi-index | 0.00 |
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can handle huge meshes with limited main memory. Our technique adapts the mesh chartification approach using Lloyd-Max quantization to out-of-core processing. While the previous approach updates chartification globally at each iteration of Lloyd-Max quantization, we propose a local update algorithm where only a part of the chartification is processed at a time. By repeating the local updates, we can obtain a chartification of a huge mesh that cannot fit into the main memory. We verify the accuracy of the serialized local updates by comparing the results with the global update approach. We demonstrate that our technique can successfully process huge meshes for applications, such as mesh compression, shape approximation, and remeshing.