D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, Homological reconstruction and simplification in R3. SoCG, pp.117-126, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00833791

C. Bajaj and D. Schikore, Topology preserving data simplification with error bounds, Computers & Graphics, vol.22, issue.1, pp.3-12, 1998.
DOI : 10.1016/S0097-8493(97)00079-4
URL : http://net.cs.utexas.edu/users/bajaj/./simp.ps.gz

C. L. Bajaj, V. Pascucci, and G. Zhuang, Single-resolution compression of arbitrary triangular meshes with properties, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), pp.247-256, 1999.
DOI : 10.1109/DCC.1999.755674

U. Bauer, C. Lange, and M. Wardetzky, Optimal Topological Simplification of Discrete Functions on Surfaces, Discrete & Computational Geometry, vol.33, issue.2, pp.347-377, 2012.
DOI : 10.1007/s00454-004-1146-y

P. Bremer, G. Weber, J. Tierny, V. Pascucci, M. Day et al., Interactive exploration and analysis of large scale simulations using topologybased data segmentation, IEEE TVCG, vol.17, issue.9, pp.1307-1324, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01211172

M. Burrows and D. Wheeler, A block sorting lossless data compression algorithm, Digital Equipment Corporation, 1994.

M. Burtscher and P. Ratanaworabhan, High Throughput Compression of Double-Precision Floating-Point Data, 2007 Data Compression Conference (DCC'07), pp.293-302, 2007.
DOI : 10.1109/DCC.2007.44

H. Carr, J. Snoeyink, and U. Axen, Computing contour trees in all dimensions, Computational Geometry, vol.24, issue.2, pp.918-926, 2000.
DOI : 10.1016/S0925-7721(02)00093-7

H. Carr, J. Snoeyink, and M. Van-de-panne, Simplifying flexible isosurfaces using local geometric measures, IEEE Visualization 2004, pp.497-504, 2004.
DOI : 10.1109/VISUAL.2004.96
URL : http://vis.computer.org/vis2004/DVD/vis/papers/carr.pdf

J. Cleary and I. Witten, Data Compression Using Adaptive Coding and Partial String Matching, IEEE Transactions on Communications, vol.32, issue.4, pp.396-402, 1984.
DOI : 10.1109/TCOM.1984.1096090
URL : http://cs.haifa.ac.il/courses/src_coding/ClearyWitten1984BasicPPM.pdf

D. Cohen-steiner, H. Edelsbrunner, and J. Harer, Stability of persistence diagrams, Symp. on Comp. Geom, pp.263-271, 2005.

F. Di and . Cappello, Fast Error-Bounded Lossy HPC Data Compression with SZ, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.730-739, 2016.
DOI : 10.1109/IPDPS.2016.11

H. Edelsbrunner and J. Harer, Computational Topology: An Introduction, 2009.
DOI : 10.1090/mbk/069

H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological Persistence and Simplification, Discrete & Computational Geometry, vol.28, issue.4, pp.511-533, 2002.
DOI : 10.1007/s00454-002-2885-2
URL : http://graphics.stanford.edu/~afra/papers/focs00/dcg.ps.gz

H. Edelsbrunner and E. P. Mucke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990.
DOI : 10.1145/77635.77639

G. Favelier, C. Gueunet, and J. Tierny, Visualizing ensembles of viscous fingers, IEEE SciVis Contest, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01359694

S. W. Golomb, Run-length encodings (Corresp.), IEEE Transactions on Information Theory, vol.12, issue.3, pp.399-401, 1966.
DOI : 10.1109/TIT.1966.1053907

D. Guenther, R. Alvarez-boto, J. Contreras-garcia, J. Piquemal, and J. Tierny, Characterizing Molecular Interactions in Chemical Systems, IEEE Transactions on Visualization and Computer Graphics, vol.20, issue.12, pp.2476-2485, 2014.
DOI : 10.1109/TVCG.2014.2346403
URL : https://hal.archives-ouvertes.fr/hal-01146475

C. Gueunet, P. Fortin, J. Jomier, J. Tierny, C. Gueunet et al., Contour forests: Fast multi-threaded augmented contour trees Task-based augmented merge trees with Fibonacci heaps, IEEE LDAV IEEE LDAV, pp.85-92, 2016.
DOI : 10.1109/ldav.2016.7874333
URL : https://hal.archives-ouvertes.fr/hal-01355328/document

A. Gyulassy, P. T. Bremer, B. Hamann, and V. Pascucci, A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.6, pp.1619-1626, 2008.
DOI : 10.1109/TVCG.2008.110

A. Gyulassy, D. Guenther, J. A. Levine, J. Tierny, and V. Pascucci, Conforming Morse-Smale Complexes, IEEE Transactions on Visualization and Computer Graphics, vol.20, issue.12, pp.2595-2603, 2014.
DOI : 10.1109/TVCG.2014.2346434
URL : https://hal.archives-ouvertes.fr/hal-01146478

C. Heine, H. Leitte, M. Hlawitschka, F. Iuricich, L. De-floriani et al., A Survey of Topology-based Methods in Visualization, Computer Graphics Forum, vol.11, issue.4, pp.643-667, 2016.
DOI : 10.1109/TVCG.2005.67

P. G. Howard and J. S. Vitter, Analysis of arithmetic coding for data compression, IEEE DCC, pp.3-12, 1991.

D. Huffman, A method for the construction of minimum-redundancy codes, pp.1098-1101, 1952.

M. Isenburg, P. Lindstrom, and J. Snoeyink, Lossless compression of predicted floating-point geometry, Computer-Aided Design, vol.37, issue.8, pp.869-877, 2005.
DOI : 10.1016/j.cad.2004.09.015

J. Iverson, C. Kamath, and G. Karypis, Fast and effective lossy compression algorithms for scientific datasets. Euro-Par, pp.843-856, 2012.
DOI : 10.1007/978-3-642-32820-6_83

S. Lakshminarasimhan, N. Shah, S. Ethier, S. Klasky, R. Latham et al., Compressing the Incompressible with ISABELA: In-situ Reduction of Spatio-temporal Data, pp.366-379, 2011.
DOI : 10.1109/MC.1984.1659158

N. K. Laurance and D. M. Monro, Embedded DCT coding with significance masking, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.2717-2720, 1997.
DOI : 10.1109/ICASSP.1997.595350

E. Levina and P. Bickel, The earthmover's distance is the mallows distance: some insights from statistics, IEEE ICCV, vol.2, pp.251-256, 2001.

P. Lindstrom, Fixed-Rate Compressed Floating-Point Arrays, IEEE Transactions on Visualization and Computer Graphics, vol.20, issue.12, pp.2674-2683, 2014.
DOI : 10.1109/TVCG.2014.2346458

P. Lindstrom, P. Chen, and E. Lee, Reducing disk storage of full-3D seismic waveform tomography (F3DT) through lossy online compression, Computers & Geosciences, vol.93, pp.45-54, 2016.
DOI : 10.1016/j.cageo.2016.04.009

P. Lindstrom and M. Isenburg, Fast and efficient compression of floatingpoint data, IEEE TVCG, vol.12, issue.5, pp.1245-1250, 2006.

V. Pascucci, G. Scorzelli, P. T. Bremer, and A. Mascarenhas, Robust on-line computation of Reeb graphs, ACM Transactions on Graphics, vol.26, issue.3, p.58, 2007.
DOI : 10.1145/1276377.1276449

V. Pascucci, X. Tricoche, H. Hagen, and J. Tierny, Topological Data Analysis and Visualization: Theory, Algorithms and Applications, 2010.

P. Ratanaworabhan, J. Ke, and M. Burtscher, Fast Lossless Compression of Scientific Floating-Point Data, Data Compression Conference (DCC'06), pp.133-142, 2006.
DOI : 10.1109/DCC.2006.35

J. Schneider and R. Westermann, Compression domain volume rendering, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, pp.293-300, 2003.
DOI : 10.1109/VISUAL.2003.1250385

J. Seward, Bzip2 data compressor, 2017.

S. W. Son, Z. Chen, W. Hendrix, A. Agrawal, W. K. Liao et al., Data compression for the exascale computing era -survey, Supercomputing Frontiers and Innovations, vol.1, issue.2, p.2014

T. Sousbie, The persistent cosmic web and its filamentary structure - I. Theory and implementation, Monthly Notices of the Royal Astronomical Society, vol.0, issue.10, pp.350-383, 2011.
DOI : 10.1109/ISVD.2010.24

G. Taubin and J. Rossignac, Geometric compression through topological surgery, ACM Transactions on Graphics, vol.17, issue.2, pp.84-115, 1998.
DOI : 10.1145/274363.274365
URL : http://www.research.ibm.com/people/t/taubin/pdfs/TaubinRossignac-tog98.pdf

J. Tierny and H. Carr, Jacobi Fiber Surfaces for Bivariate Reeb Space Computation, IEEE Transactions on Visualization and Computer Graphics, vol.23, issue.1, pp.960-969, 2016.
DOI : 10.1109/TVCG.2016.2599017
URL : https://hal.archives-ouvertes.fr/hal-01349907

J. Tierny, G. Favelier, J. A. Levine, C. Gueunet, and M. Michaux, The Topology ToolKit, IEEE Transactions on Visualization and Computer Graphics, vol.24, issue.1, pp.832-842, 2017.
DOI : 10.1109/TVCG.2017.2743938
URL : https://hal.archives-ouvertes.fr/hal-01499905

J. Tierny, D. Guenther, and V. Pascucci, Optimal general simplification of scalar fields on surfaces. Topological and Statistical Methods for Complex Data, pp.57-71, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01206848

J. Tierny, A. Gyulassy, E. Simon, and V. Pascucci, Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees, IEEE Transactions on Visualization and Computer Graphics, vol.15, issue.6, pp.1177-1184, 2009.
DOI : 10.1109/TVCG.2009.163
URL : https://hal.archives-ouvertes.fr/hal-01211176

J. Tierny and V. Pascucci, Generalized Topological Simplification of Scalar Fields on Surfaces, IEEE Transactions on Visualization and Computer Graphics, vol.18, issue.12, pp.2005-2013, 2012.
DOI : 10.1109/TVCG.2012.228
URL : https://hal.archives-ouvertes.fr/hal-01206877

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714

J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.
DOI : 10.1109/TIT.1978.1055934