Paper
5 October 1998 Multilayered storage and transmission for animated 3D polygonal meshes
K. Selcuk Candan, Michael G. Wagner
Author Affiliations +
Proceedings Volume 3527, Multimedia Storage and Archiving Systems III; (1998) https://doi.org/10.1117/12.325829
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States
Abstract
Highly detailed geometric models are rapidly becoming common-place in computer graphics and multimedia. MPEG4 is introducing standards for 3D polygon meshes. Analogously to video, highly complex polygon meshes challenge not only rendering performance but also transmission bandwidth and storage capacities. Current work focuses only on the compression, and progressive refinement and transmission of static polygon meshes. On the other hand, geometric content is no longer static, it allows user interaction and complex changes within the geometry. Since this emerging problem has to be addressed in any future multimedia standard this paper aims to open the research by exploring similarities and differences in transmission and storage of dynamically changing polygon meshes and geometry compared to other stream data, such as video. In this paper we propose techniques for multi-layered storage and transmission of animated geometry in low bandwidth environments. Our approach extends existing technologies for multi-layered representation of static polygon meshes to dynamic architectures.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
K. Selcuk Candan and Michael G. Wagner "Multilayered storage and transmission for animated 3D polygonal meshes", Proc. SPIE 3527, Multimedia Storage and Archiving Systems III, (5 October 1998); https://doi.org/10.1117/12.325829
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Video

Solid modeling

Visualization

3D modeling

3D video streaming

Image compression

Multimedia

Back to Top