• Title of article

    Vertex data compression through vector quantization

  • Author/Authors

    Chou، نويسنده , , P.H.، نويسنده , , Meng، نويسنده , , T.H.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2002
  • Pages
    10
  • From page
    373
  • To page
    382
  • Abstract
    Rendering geometrically detailed 3D models requires the transfer and processing of large amounts of triangle and vertex geometry data. Compressing the geometry bitstream can reduce bandwidth requirements and alleviate transmission bottlenecks. In this paper, we show vector quantization to be an effective compression technique for triangle mesh vertex data. We present predictive vector quantization methods using unstructured codebooks as well as a product code pyramid vector quantizer. The technique is compatible with most existing mesh connectivity encoding schemes and does not require the use of entropy coding. In addition to compression, our vector quantization scheme can be used for complexity reduction by accelerating the computation of linear vertex transformations. Consequently, an encoded set of vertices can be both decoded and transformed in approximately 60 percent of the time required by a conventional method without compression.
  • Keywords
    Computer graphics , Data compression , geometry compression , vector quantization.
  • Journal title
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
  • Serial Year
    2002
  • Journal title
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
  • Record number

    401732