Lossless Compression of 3-D Point Data in QSplat Representation

Jae Young Sim, Chang-Su Kim, Sang Uk Lee

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


We propose a lossless compression algorithm for three-dimensional point data in graphics applications. In typical point representation, each point is treated as a sphere and its geometrical and normal data are stored in the hierarchical structure of bounding spheres. The proposed algorithm sorts child spheres according to their positions to achieve a higher coding gain for geometrical data. Also, the proposed algorithm compactly encodes normal data by exploiting high correlation between parent and child normals. Simulation results show that the proposed algorithm saves up to 60% of storage space.

Original languageEnglish
Pages (from-to)1191-1195
Number of pages5
JournalIEEE Transactions on Multimedia
Issue number6
Publication statusPublished - 2005 Dec


  • 3-D point data
  • Lossless compression
  • QSplat

ASJC Scopus subject areas

  • Signal Processing
  • Media Technology
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this