Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Triangle Strip Compression

From MaRDI portal
Publication:2758559
Jump to:navigation, search

DOI10.1111/1467-8659.00481zbMath0984.68567OpenAlexW1977581205MaRDI QIDQ2758559

Martin Isenburg

Publication date: 14 May 2002

Published in: Computer Graphics Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-8659.00481


zbMATH Keywords

mesh compressionstripification


Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99)


Related Items (2)

Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits ⋮ The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.







This page was built for publication: Triangle Strip Compression

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2758559&oldid=15635736"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki