• DocumentCode
    3063194
  • Title

    Geometric compression for fast transmission

  • Author

    Geeali, L.P. ; Sun, C.

  • Author_Institution
    Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
  • fYear
    2001
  • fDate
    36982
  • Firstpage
    465
  • Lastpage
    469
  • Abstract
    A compact representation of a two dimensional mesh can significantly reduce transmission of mesh data over the Internet. Compact representation of the mesh is also desirable for saving storage space. The compressibility of a mesh can be elegantly captured in term of Hamiltonian graphs. In this paper we present an algorithm to partition a convex polygon into a triangular mesh that admits Hamiltonian paths
  • Keywords
    Internet; computational geometry; data compression; 2D mesh; Hamiltonian graphs; Hamiltonian paths; Internet; compact representation; convex polygon partitioning; fast transmission; geometric compression; storage space; triangular mesh; Computer graphics; Computer science; Data visualization; Encoding; Internet; Mesh generation; Partitioning algorithms; Scattering; Strips; Sun;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology: Coding and Computing, 2001. Proceedings. International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    0-7695-1062-0
  • Type

    conf

  • DOI
    10.1109/ITCC.2001.918840
  • Filename
    918840
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3063194