loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing (ITCC '01)
Geometric Compression for Fast Transmission
Las Vegas, NV
April 02-April 04
ISBN: 0-7695-1062-0
L. Gewali, University of Nevada
C. Sun, University of Nevada
Abstract: A compact representation of two dimensional mesh can significantly reduce transmission of mesh data across the internet. Compact representation of 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.
Citation:
L. Gewali, C. Sun, "Geometric Compression for Fast Transmission," itcc, pp.0465, International Conference on Information Technology: Coding and Computing (ITCC '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.