Efficient coding of non-triangular mesh connectivity

B. Kronrod, Craig Gotsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

Describes 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 the treatment of non-triangular 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 two bits/triangle (approximately four 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 quadrilateral mesh with few triangles in no more than four bits/polygon.

Original languageEnglish (US)
Title of host publicationProceedings - 8th Pacific Conference on Computer Graphics and Applications, PG 2000
EditorsBrian A. Barsky, Yoshihisa Shinagawa, Wenping Wang
PublisherIEEE Computer Society
Pages235-242
Number of pages8
Volume2000-January
ISBN (Electronic)0769508685
DOIs
StatePublished - Jan 1 2000
Externally publishedYes
Event8th Pacific Conference on Computer Graphics and Applications, PG 2000 - Hong Kong, China
Duration: Oct 3 2000Oct 5 2000

Other

Other8th Pacific Conference on Computer Graphics and Applications, PG 2000
Country/TerritoryChina
CityHong Kong
Period10/3/0010/5/00

All Science Journal Classification (ASJC) codes

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

Fingerprint

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

Cite this