Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

CVGIP
2002

favoriteEmaildiscussreport

81views more CVGIP 2002»

Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes

13 years 11 months ago

Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes

Download csdrm.caltech.edu

Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun

Real-time Traffic

CVGIP 2002 |

claim paper

Related Content

» A New Paradigm for Changing Topology during Subdivision Modeling

» High rate compression of CAD meshes based on subdivision inversion

» Encoding Quadrilateral Meshes

» Efficient Compression of NonManifold Polygonal Meshes

» DistanceRanked Connectivity Compression of Triangle Meshes

» Dual Mesh Resampling

» DistortionFree Steganography for Polygonal Meshes

» Consistent Normal Orientation for Polygonal Meshes

» Higher Order Prediction for Geometry Compression

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	CVGIP
Authors	Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun, Peter Schröder

Comments (0)