%0 Conference Proceedings
%T ESQ: Editable SQuad representation for triangle meshes
%D 2012
%A Aleardi, Luca Castelli,
%A Devillers, Olivier,
%A Rossignac, Jarek,
%@affiliation Ecole Polytechnique
%@affiliation INRIA Sophia-Antipolis
%@affiliation Georgia Institute of Technology
%E Freitas, Carla Maria Dal Sasso,
%E Sarkar, Sudeep,
%E Scopigno, Roberto,
%E Silva, Luciano,
%B Conference on Graphics, Patterns and Images, 25 (SIBGRAPI)
%C Ouro Preto
%8 Aug. 22-25, 2012
%S Proceedings
%I IEEE Computer Society
%J Los Alamitos
%K triangle meshes, compact representations, mesh data structures.
%X We consider the problem of designing space efficient solutions for representing the connectivity information of manifold triangle meshes. Most mesh data structures are quite redundant, storing a large amount of information in order to efficiently support mesh traversal operators. Several compact data structures have been proposed to reduce storage cost while supporting constant-time mesh traversal. Some recent solutions are based on a global re-ordering approach, which allows to implicitly encode a map between vertices and faces. Unfortunately, these compact representations do not support efficient updates, because local connectivity changes (such as edge-contractions, edge-flips or vertex insertions) require reordering the entire mesh. Our main contribution is to propose a new way of designing compact data structures which can be dynamically maintained. In our solution, we push further the limits of the re-ordering approaches: the main novelty is to allow to re-order vertex data (such as vertex coordinates), and to exploit this vertex permutation to easily maintain the connectivity under local changes. We describe a new class of data structures, called Editable SQuad (ESQ), offering the same navigational and storage performance as previous works, while supporting local editing in amortized constant time. As far as we know, our solution provides the most compact dynamic data structure for triangle meshes. We propose a linear-time and linear-space construction algorithm, and provide worst-case bounds for storage and time cost.
%@language en
%3 PID2444419.pdf