๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Postprocessing of Compressed 3D Graphic Data

โœ Scribed by Ka Man Cheang; Wenlong Dong; Jiankun Li; C.-C.Jay Kuo


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
326 KB
Volume
11
Category
Article
ISSN
1047-3203

No coin nor oath required. For personal study only.

โœฆ Synopsis


This work presents a postprocessing technique applied to a 3D graphic model of a lower resolution to obtain a visually more pleasant representation. Our method is an improved version of the modified butterfly subdivision scheme developed by Zorin and his colleagues. Our main contribution is to exploit the flatness information of local areas of a 3D graphic model for adaptive refinement in relatively coarser areas. We can avoid unnecessary subdivision in regions which are smoother. Consequently, the new algorithm reduces the computational complexity and also saves the storage space for many models. Our algorithm can also remove overshoots around sharp edges and retain sharp features.


๐Ÿ“œ SIMILAR VOLUMES


Graphic recording of digital data
โœ V. N. Dedikov; A. S. Paritskii; V. S. Soloshenko ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Springer US ๐ŸŒ English โš– 139 KB
Compression of Dynamic 3D Geometry Data
โœ Sumit Gupta; Kuntal Sengupta; Ashraf A. Kassim ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

In this paper, we propose a new framework to perform motion compression for time-dependent 3D geometric data. Temporal coherence in dynamic geometric models can be used to achieve significant compression, thereby leading to efficient storage and transmission of large volumes of 3D data. The displace

Graphic presentation of blood gas data
โœ Bernauer, J. ;Bender, H. J. ;Hartung, H. J. ;Osswald, P. M. ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Springer ๐ŸŒ English โš– 254 KB
Efficient decoding of compressed data
โœ Bassiouni, Mostafa A. ;Mukherjee, Amar ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 944 KB

In this article, we discuss the problem of enhancing the speed of Huffman decoding. One viable solution to this problem is the multibit scheme which uses the concept of k-bit trees to decode up to k bits at a time. A linear-time optimal solution for the mapping of 2-bit trees into memory is presente

Use of 3-D color graphics with EGS
โœ R. Cowan; W.R. Nelson ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 66 KB

Recent efforts toward developing software systems for the detectors in TRISTAN at KEK are reviewed. The software structures on a mainframe computer at KEK are presented for each experimental group (TOPAZ and VENUS). The covered topics include data structures, database management systems, graphics, o