Hierarchical representation and coding of 3D mesh geometry. Celasun, I., Eroeksuez, S., Siddiqui, R. A., & Tekalp, A. M. In 2006 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP 2006, PROCEEDINGS, of IEEE International Conference on Image Processing ICIP, pages 1893-1896, 2006. IEEE. IEEE International Conference on Image Processing (ICIP 2006), Atlanta, GA, OCT 08-11, 2006
doi  abstract   bibtex   
Hierarchical mesh representation and mesh simplification have been addressed in computer graphics for adaptive level-of-detail rendering of 3D objects. In this paper, we propose a hierarchical system suitable for progressive transmission using hierarchical 3D meshes such that each mesh level has Delaunay topology. The Delaunay topology constraint on each mesh layer not only helps to design meshes with desired geometric properties, but also enables efficient compression of the mesh data. The hierarchical compression technique is based on a nearest-neighbor ordering of mesh node points. This ordering serves to define the mesh boundary as well as a spatial prediction relation on the nodes, which is employed for differential node point location. The compression method allows progressive transmission and quality scalability.
@inproceedings{ ISI:000245768501092,
Author = {Celasun, Isil and Eroeksuez, Serkan and Siddiqui, Rizwan A. and Tekalp,
   A. Murat},
Book-Group-Author = {{IEEE}},
Title = {{Hierarchical representation and coding of 3D mesh geometry}},
Booktitle = {{2006 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP 2006,
   PROCEEDINGS}},
Series = {{IEEE International Conference on Image Processing ICIP}},
Year = {{2006}},
Pages = {{1893-1896}},
Note = {{IEEE International Conference on Image Processing (ICIP 2006), Atlanta,
   GA, OCT 08-11, 2006}},
Organization = {{IEEE}},
Abstract = {{Hierarchical mesh representation and mesh simplification have been
   addressed in computer graphics for adaptive level-of-detail rendering of
   3D objects. In this paper, we propose a hierarchical system suitable for
   progressive transmission using hierarchical 3D meshes such that each
   mesh level has Delaunay topology. The Delaunay topology constraint on
   each mesh layer not only helps to design meshes with desired geometric
   properties, but also enables efficient compression of the mesh data. The
   hierarchical compression technique is based on a nearest-neighbor
   ordering of mesh node points. This ordering serves to define the mesh
   boundary as well as a spatial prediction relation on the nodes, which is
   employed for differential node point location. The compression method
   allows progressive transmission and quality scalability.}},
DOI = {{10.1109/ICIP.2006.313106}},
ISSN = {{1522-4880}},
ISBN = {{978-1-4244-0481-0}},
Unique-ID = {{ISI:000245768501092}},
}
Downloads: 0