Efficient coding of nontriangular mesh connectivity

Boris Kronrod, Craig Gotsman

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


We describe an efficient algorithm for coding the connectivity information of general polygon meshes. In contrast to most existing algorithms which are suitable only for triangular meshes, and pay a penalty for treatment of nontriangular faces, this algorithm codes the connectivity information in a direct manner. Our treatment of the special case of triangular meshes is shown to be equivalent to the Edgebreaker algorithm. Using our methods, any triangle mesh may be coded in no more than 2 bits/triangle (approximately 4 bits/vertex), a quadrilateral mesh in no more than 3.5 bits/quad (approximately 3.5 bits/vertex), and the most common case of a quad mesh with few triangles in no more than 4 bits/polygon.

Original languageEnglish (US)
Pages (from-to)263-275
Number of pages13
JournalGraphical Models
Issue number4
StatePublished - Jul 2001
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Geometry and Topology
  • Computer Graphics and Computer-Aided Design


  • Coding
  • Mesh compression


Dive into the research topics of 'Efficient coding of nontriangular mesh connectivity'. Together they form a unique fingerprint.

Cite this