Title:
Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs
Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs
| dc.contributor.author | King, Davis | |
| dc.contributor.author | Rossignac, Jarek | |
| dc.date.accessioned | 2004-10-15T14:26:35Z | |
| dc.date.available | 2004-10-15T14:26:35Z | |
| dc.date.issued | 1999 | |
| dc.description.abstract | We present a new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits. Our code improves on all prior solutions to this well studied problem and lies within 13% of the theoretical lower limit of the worst case guaranteed bound. It is based on a new encoding of the CLERS string produced by Rossignac's Edgebreaker compression [Rossignac99]. The elegance and simplicity of this technique makes it suitable for a variety of 2D and 3D triangle mesh compression applications. Simple and fast compression/decompression algorithms with linear time and space complexity are available. | en |
| dc.format.extent | 128188 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/3384 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en |
| dc.relation.ispartofseries | GVU Technical Report;GIT-GVU-99-17 | |
| dc.subject | 3D representations | en |
| dc.subject | Triangle meshes | en |
| dc.subject | Planar graph encoding | en |
| dc.subject | Geometry compression | en |
| dc.title | Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs | en |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.author | Rossignac, Jarek | |
| local.contributor.corporatename | GVU Center | |
| local.relation.ispartofseries | GVU Technical Report Series | |
| relation.isAuthorOfPublication | d854d72c-9694-4442-bd2f-fb8859bade72 | |
| relation.isOrgUnitOfPublication | d5666874-cf8d-45f6-8017-3781c955500f | |
| relation.isSeriesOfPublication | a13d1649-8f8b-4a59-9dec-d602fa26bc32 |