Coding polygon meshes as compressable ASCII
Proceedings of the seventh international conference on 3D Web technology
Proceedings of the conference on Visualization '01
Compressing large polygonal models
Proceedings of the conference on Visualization '01
IEEE Transactions on Visualization and Computer Graphics
Compressing the property mapping of polygon meshes
Graphical Models - Pacific graphics 2001
An optimal algorithm for the minimum edge cardinality cut surface problem
Proceedings of the nineteenth annual symposium on Computational geometry
Compression techniques for distributed use of 3D data: an emerging media type on the internet
ICCC '02 Proceedings of the 15th international conference on Computer communication
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing
IEEE Transactions on Visualization and Computer Graphics
A Parallel Framework for Simplification of Massive Meshes
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Fast reconstruction of Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Geometry engine optimization: cache friendly compressed representation of geometry
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Data-Centric Visual Sensor Networks for 3D Sensing
GeoSensor Networks
Fast reconstruction of Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
| Hi-index | 0.00 |
We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.