Academics

"Compact Connectivity Representation for Triangle Meshes"

I got my PhD in Computer Science from Georgia Institute of Technology. I defended my thesis in Jan 2013. My thesis was on compression techniques for connectivity of triangle meshes. Over a series of papers (listed below), we improved results using different algorithmic techniques and reduced the space requirement from 6 integers per triangle down to 6 *bits* per triangle! For comparison (for a large mesh), we use a 32-bit integer (i.e. 6 *32-bit* integers) which means our method has provided a 32x reduction!). Amazingly, the time required for basic operations for the data structure that requires 6 bits per triangle is constant (it is fast!).

Publications:

We published in top Computer Graphics venues such as SIGGRAPH and EUROGRAPHICS.

Grouper: A compact, streamable triangle mesh data structure

Mark Luffel, Topraj Gurung, Peter Lindstrom, Jarek Rossignac

TVCG 2013

Zipper: A compact connectivity data structure for triangle meshes

Topraj Gurung, Mark Luffel, Peter Lindstrom, Jarek Rossignac

SPM 2012 (6 bits per triangle)

LR: Compact Connectivity Representation for Triangle Meshes

Topraj Gurung, Mark Luffel, Peter Lindstrom, Jarek Rossignac

SIGGRAPH 2011 (1 integer per triangle)

SQuad: Compact Representation for Triangle Meshes

Topraj Gurung, Daniel Laney, Peter Lindstrom, Jarek Rossignac

EUROGRAPHICS 2011 (2 integers per triangle)

SOT: Compact Representation for Tetrahedral Meshes

Topraj Gurung, Jarek Rossignac

SPM 2009 (3 integers per triangle)