Optimizing Markov models with applications to triangular connectivity coding

MaRDI QIDQ2921686zbMATH OpenFDO

Authors Stefan Gumhold

Publication date 13 October 2014

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• Efficient Coding of Nontriangular Mesh Connectivity
• An edgebreaker-based efficient compression scheme for regular meshes
• Context-Based Entropy Encoding Method for Connectivity Compression of Meshes
• scientific article; zbMATH DE number 5941301

This page was built for publication: Optimizing Markov models with applications to triangular connectivity coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921686)