Progressive compression of manifold polygon meshes

Abstract

This paper presents a new algorithm for the progressive compression of manifold polygon meshes. The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines vertex removal and local remeshing. The mesh connectivity is encoded by two lists of Boolean error predictions based on the mesh geometry: one for the inserted edges and the other for the faces with a removed center vertex. The mesh geometry is encoded with a barycentric error prediction of the removed vertex coordinates and a local curvature prediction. We also include two methods that improve the rate-distortion performance: a wavelet formulation with a lifting scheme and an adaptive quantization technique. Experimental results demonstrate the effectiveness of our approach in terms of compression rates and rate-distortion performance.

Optimization Techniques for 3D Graphics Deployment on Mobile Devices

“…It should be noted that progressive LODs are an option when the capacity of the mobile device is high due to the potential decoding overhead inflicted on the mobile CPU. When wireless bandwidth is scarce, it is important to choose a progressive method that provides a very low bpv ratio (e.g., [64]) to enable as efficient use of the wireless bandwidth as possible. When wireless bandwidth is not a limiting factor, a hybrid combination of discrete and progressive methods presented by Limper et al [40] is an ideal choice, because it does not require any decoding on the mobile CPU.…”

“…For simplifying geometry, the literature introduces various methods that focus on simplifying different features of geometry. These methods include, but are not limited to, edge collapse [33,61], geometry quantization [40,62,63], geometry decimation [64], triangle decimation and cleansing conquest [40,62,65,66], mesh partitioning [56] and vertex clustering [54]. It should be noted that this article does not focus on the algorithmic details of each individual method, since this information is already comprehensively summarized, for instance, in recent surveys [60,67].…”

“…However, only color information is preserved for the vertices. Maglo et al [64] present a progressive method based on geometry decimation and re-encoding of the decimated surfaces based on the new edge information. The method is able to perform encoding at a rate of 93k triangles/s and decoding 122k triangles/s when using Intel Core i7 CPU.…”

“…As earlier mentioned, the capabilities of mobile hardware for 3D graphics re-production grow On-device optimization [8] x [33] x x [34] x [35] x [36] x [37] x [38] x x [39] x [40] x x [41] x [42] x [43] x x [44] x [53] x [54] x x [55] x x [56] x x [57] x x [58] x [60] x [61] x [62] x x [63] x x [64] x x [65] x [66] x [67] x [68] x [69] x [70] x [71] x [72] x [73] x [74] x x [76] x x [77] x [78] x [79] x [80] x [81] x [82] x [83] x [84] x extremely fast. For instance, 3D rendering performance of Tegra4 is roughly three-four times higher when compared to the previous generation [45].…”

Case Based Reasoning Support for Adaptive Finite Element Analysis: Mesh Selection for an Integrated System

“…In order to attain the optimum results a number of posteriori error estimation techniques have been (Cho & Jun, 2004;Devloo, Tinsley Oden, & Pattani, 1988;Gatica, González, & Meddahi, 2004;Houston, Schötzau, & Wihler, 2006;Lee, Chiew, Lie, & Nguyen, 2010;Maglo, Courbet, Alliez, & Hudelot, 2012;Rank & Roβmann, 1988;Schweitzer, 2009;Stewart & Hughes, 1997;Warichet & Legat, 1996;Yvonnet, Coffignal, Ryckelynck, Lorong, & Chinesta, 2006). However, following four error estimation based adaptive re-meshing methods are being commonly used.…”