Filters








3,387 Hits in 3.8 sec

Optimized triangle mesh compression using prediction trees

B. Kronrod, C. Gotsman
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications  
Since each vertex's coordinates are predicted from the preceding triangle in the tree, the cost of each tree edge is the prediction error between the two appropriate mesh triangles.  ...  By using a carefully designed cover tree, of which there are many, we are able to optimize it to achieve better coding of the vertex geometry.  ...  Since each vertex's coordinates are predicted from the preceding triangle in the tree, the cost of each tree edge is the prediction error between the two appropriate mesh triangles.  ... 
doi:10.1109/pccga.2000.883968 dblp:conf/pg/KronrodG00a fatcat:aulcugwbjvhnbmqqb46qeojiwm

Optimized compression of triangle mesh geometry using prediction trees

B. Kronrod, C. Gotsman
Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission  
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code.  ...  This paper proposes a manifold mesh code which optimizes the geometric component, at the slight expense of the connectivity code.  ...  Note that this cover tree covers only a subset of the mesh triangles, as opposed to the triangle cover trees used by the Topological Surgery method [13] , which cover all the mesh triangles (vertices  ... 
doi:10.1109/tdpvt.2002.1024124 dblp:conf/3dpvt/KronrodG02 fatcat:nvmx7eqgtzd77bs5apoqkwnnc4

Rate-distortion optimized compression and view-dependent transmission of 3-D normal meshes

Jae-Young Sim, Chang-Su Kim, C.-C.J. Kuo, Sang-Uk Lee
2005 IEEE transactions on circuits and systems for video technology (Print)  
Index Terms-Independent partitioning, normal meshes, ratedistortion optimization, view-dependent transmission, 3-D mesh compression.  ...  A unified approach to rate-distortion (R-D) optimized compression and view-dependent transmission of three-dimensional (3-D) normal meshes is investigated in this work.  ...  Rate-Distortion Optimized Compression and View-Dependent Transmission of 3-D Normal Meshes I.  ... 
doi:10.1109/tcsvt.2005.848349 fatcat:glap2dluc5hsxh5gpp3l6lq6pu

Geometry Compression Of Tetrahedral Meshes Using Optimized Prediction

Dan Chen, Yi-Jen Chiang, Nasir Memon, Xiaolin Wu
2005 Zenodo  
We formulate the problem of optimally (traversing tetrahedra and) predicting the vertices via flippings as a combinatorial optimization problem of constructing a constrained minimum spanning tree.  ...  As mentioned before, these techniques achieve an impressive compression performance of 1-2 bits per triangle for triangle meshes [23, 19, 1] , and 2.04-2.31 bits per tetrahedron for tetrahedral meshes  ... 
doi:10.5281/zenodo.39279 fatcat:z2imjiz3vzhbjmn6mn6j53e7uu

Grow & fold: compressing the connectivity of tetrahedral meshes

A. Szymczak, J. Rossignac
2000 Computer-Aided Design  
Additional bits must be used for each handle in the mesh and for each topological 'lock' in the tree.  ...  compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both  ...  Acknowledgements This work was supported by the Swiss NF grant 81EZ-54524 and US NSF grant 9721358.  ... 
doi:10.1016/s0010-4485(00)00040-3 fatcat:jwpjm4ydqjh4hcxthgorx3urqe

Technologies for 3D mesh compression: A survey

Jingliang Peng, Chang-Su Kim, C.-C. Jay Kuo
2005 Journal of Visual Communication and Image Representation  
Three-dimensional (3D) meshes have been widely used in graphic applications for the representation of 3D objects.  ...  In this survey paper, we examine 3D mesh compression technologies developed over the last decade, with the main focus on triangular mesh compression technologies.  ...  Mathieu Desbrun at the California Institute of Technology for his useful comments and suggestions.  ... 
doi:10.1016/j.jvcir.2005.03.001 fatcat:p2eznyx7hvagrfbbrf4pte3xae

HCCMeshes: Hierarchical-Culling oriented Compact Meshes

Tae-Joon Kim, Yongyoung Byun, Yongjin Kim, Bochang Moon, Seungyong Lee, Sung-Eui Yoon
2010 Computer graphics forum (Print)  
The i-HCCMesh and o-HCCMesh show 3.6:1 and 10.4:1 compression ratios on average, compared to a naively compressed (e.g., quantized) mesh and BVH representation.  ...  To support such hierarchical culling, bounding volume hierarchies (BVHs) combined with meshes are widely used.  ...  To apply the prediction method, we construct the mesh information during compression and decompression as used in the streaming mesh compression method [ILS05] .  ... 
doi:10.1111/j.1467-8659.2009.01599.x fatcat:4wylp4snq5dabk7cpestfbnciq

HCCMeshes

Tae-Joon Kim, Yongyoung Byun, Yongjin Kim, Bochang Moon, Seungyong Lee, Sung-Eui Yoon
2010 ACM SIGGRAPH 2010 Posters on - SIGGRAPH '10  
The i-HCCMesh and o-HCCMesh show 3.6:1 and 10.4:1 compression ratios on average, compared to a naively compressed (e.g., quantized) mesh and BVH representation.  ...  To support such hierarchical culling, bounding volume hierarchies (BVHs) combined with meshes are widely used.  ...  To apply the prediction method, we construct the mesh information during compression and decompression as used in the streaming mesh compression method [ILS05] .  ... 
doi:10.1145/1836845.1836997 dblp:conf/siggraph/KimBKMLY10 fatcat:y7ouw6nnqbg57j4f3kubfg22va

Lossless Compression of Adaptive Multiresolution Meshes

Felix Kälberer, Konrad Polthier, Christoph von Tycowicz
2009 2009 XXII Brazilian Symposium on Computer Graphics and Image Processing  
The compressor uses the parent/child relationships inherent to the hierarchical mesh.  ...  All other triangles can be reconstructed using rules of the refinement scheme as explained in the text.  ...  Finally we thank Andrzej Szymczak for providing the Optimized Edgebreaker compression rates.  ... 
doi:10.1109/sibgrapi.2009.53 dblp:conf/sibgrapi/KalbererPT09 fatcat:xwzr6unz7jbopi7x7gjmlws4yq

Geometric compression through topological surgery

Gabriel Taubin, Jarek Rossignac
1998 ACM Transactions on Graphics  
A triangle spanning tree and a sequence of marching bits are used to encode the triangulation of the polygon.  ...  In this scheme, vertex positions are quantized within the desired accuracy, a vertex spanning tree is used to predict the position of each vertex from 2, 3, or 4 of its ancestors in the tree, and the correction  ...  ACKNOWLEDGMENTS We would like to thank Bill Horn for providing us with a VRML translator and for integrating it with these technologies, Francis Lazarus and Andre Guéziec for contributing ideas and helping  ... 
doi:10.1145/274363.274365 fatcat:3lrc4s6tt5ddbieeoulr4ima3i

Efficient compression of non-manifold polygonal meshes

André Guéziec, Frank Bossen, Gabriel Taubin, Claudio Silva
1999 Computational geometry  
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  ...  C: Overall compressed syntax for a non-manifold mesh.  ...  The coordinate prediction was done using the "parallelogram prediction" [4] , the color prediction was be done along the triangle tree (see Section 4), and there was no normal prediction.  ... 
doi:10.1016/s0925-7721(99)00027-9 fatcat:kpdpildhmbdwvicwm5r2wbpz4m

CHuMI viewer: Compressive huge mesh interactive viewer

Clément Jamin, Pierre-Marie Gandoin, Samir Akkouche
2009 Computers & graphics  
The preprocessing of large meshes to provide and optimize interactive visualization implies a complete reorganization that often introduces significant data growth.  ...  The performance attained is near state-of-the-art in terms of the compression ratio as well as the visualization frame rates, offering a unique combination that can be useful in numerous applications.  ...  Using a simple prediction based on the triangle orientation in the neighborhood, the overcost is made negligible (around 0.01 bit per vertex).  ... 
doi:10.1016/j.cag.2009.03.029 fatcat:gktj3pcjlbe57a3iu2fhxok7nm

3D Geometry Compressionand Progressive Transmission [article]

Gabriel Taubin
1999 Eurographics State of the Art Reports  
Because of its widespread use, it is desirable to compress polygonal meshes stored in file servers and exchanged over computer networks to reduce storage and transmission time requirements.  ...  In this report we describe several schemes that have been recently introduced to represent single and multi-resolution polygonal meshes in compressed form, and to progressively transmit polygonal mesh  ...  Properties bound per face and per corner are predicted as a linear combination of ancestors along a tree. Per face properties use the triangle tree.  ... 
doi:10.2312/egst.19991071 fatcat:553siphepvhr5n5quuck4rddvq

Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces [chapter]

Jarek Rossignac, Alla Safonova, Andrzej Szymczak
2003 Mathematics and Visualization  
Further compression to 3.6V bits may be guaranteed by using context-based codes for the clers symbols. Entropy codes reduce the storage for large meshes to less than 2V bits.  ...  For meshes homeomorphic to a sphere, it may be compressed to less that 4V bits by storing the "clers" sequence of triangle-labels from the set {C,L,E,R,S}.  ...  Compress is a recursive procedure that traverses the mesh along a spiraling triangle-spanning tree. A recursion starts at triangles that are of type S.  ... 
doi:10.1007/978-3-642-55787-3_3 fatcat:p52ord7g65g7bh66ldrlqlcx7i

Static 3D triangle mesh compression overview

Marcos Aviles, Francisco Moran
2008 2008 15th IEEE International Conference on Image Processing  
3D triangle meshes are extremely used to model discrete surfaces, and almost always represented with two tables: one for geometry and another for connectivity.  ...  While the raw size of a triangle mesh is of around 200 bits per vértex, by coding cleverly (and separately) those two distinct kinds of information it is possible to achieve compression ratios of 15:1  ...  Turan [30] observed that the connectivity of a planar graph can be encoded with a constant number of bpv using two spanning trees: a vértex spanning tree and a triangle spanning tree.  ... 
doi:10.1109/icip.2008.4712347 dblp:conf/icip/AvilesM08 fatcat:jo6uvrx5hndx5gjwpdxsgyx75u
« Previous Showing results 1 — 15 out of 3,387 results