A parallel and memory efficient algorithm for constructing the contour tree, 2015 IEEE Pacific Visualization Symposium (PacificVis), 2015. ,
DOI : 10.1109/PACIFICVIS.2015.7156387
The landscape of parallel computing research: a view from berkeley, 2006. ,
The contour spectrum, Proceedings. Visualization '97 (Cat. No. 97CB36155), 1997. ,
DOI : 10.1109/VISUAL.1997.663875
Critical Points and Curvature for Embedded Polyhedral Surfaces, The American Mathematical Monthly, vol.77, issue.5, 1970. ,
DOI : 10.2307/2317380
Reeb graphs for shape analysis and applications, Theoretical Computer Science, vol.392, issue.1-3, 2008. ,
DOI : 10.1016/j.tcs.2007.10.018
Hybrid techniques for real-time radar simulation, Proceedings of the November 12-14, 1963, fall joint computer conference on XX, AFIPS '63 (Fall), 1963. ,
DOI : 10.1145/1463822.1463869
Interactive Exploration and Analysis of Large-Scale Simulations Using Topology-Based Data Segmentation, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.9, 2011. ,
DOI : 10.1109/TVCG.2010.253
URL : https://hal.archives-ouvertes.fr/hal-01211172
Computing contour trees in all dimensions, Proc. of Symposium on Discrete Algorithms, pp.918-926, 2000. ,
DOI : 10.1016/S0925-7721(02)00093-7
Simplifying flexible isosurfaces using local geometric measures, IEEE Visualization 2004, pp.497-504, 2004. ,
DOI : 10.1109/VISUAL.2004.96
Simple and optimal outputsensitive construction of contour trees using monotone paths, Computational Geometry Theory and Applications, 2005. ,
Loops in Reeb graphs of 2-manifolds, Proc. of ACM Symposium on Computational Geometry, pp.344-350, 2003. ,
Introduction to Algorithms, 2001. ,
Morse complexes for shape segmentation and homological analysis: discrete models and algorithms, Computer Graphics Forum, vol.32, issue.3, 2015. ,
DOI : 10.1111/cgf.12596
libtourtre: A contour tree library, 2007. ,
http: //shapes.aim-at-shape, 2006. ,
Computational Topology: An Introduction, 2009. ,
DOI : 10.1090/mbk/069
Topological Persistence and Simplification, Discrete & Computational Geometry, vol.28, issue.4, pp.511-533, 2002. ,
DOI : 10.1007/s00454-002-2885-2
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
Stability of Dissipation Elements: A Case Study in Combustion, Proc. of EuroVis), 2014. ,
DOI : 10.1111/cgf.12361
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality, Proc. of IEEE VIS, pp.1619-1626, 2008. ,
DOI : 10.1109/TVCG.2008.110
Interstitial and Interlayer Ion Diffusion Geometry Extraction in Graphitic Nanosphere Battery Materials, Proc. of IEEE VIS, p.2015 ,
DOI : 10.1109/TVCG.2015.2467432
Topologically Clean Distance Fields, Proc. of IEEE VIS, pp.1432-1439, 2007. ,
DOI : 10.1109/TVCG.2007.70603
In-Situ Feature Extraction of Large Scale Combustion Simulations Using Segmented Merge Trees, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, 2014. ,
DOI : 10.1109/SC.2014.88
Understanding the Structure of the Turbulent Mixing Layer in Hydrodynamic Instabilities, Proc. of IEEE VIS, 2006. ,
DOI : 10.1109/TVCG.2006.186
A hybrid parallel algorithm for computing and tracking level set topology, 2012 19th International Conference on High Performance Computing, 2012. ,
DOI : 10.1109/HiPC.2012.6507496
Distributed merge trees, ACM Symposium on Principles and Practice of Parallel Programming, 2013. ,
DOI : 10.1145/2517327.2442526
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6895
Distributed Contour Trees, Topological Methods in Data Analysis and Visualization III, 2014. ,
DOI : 10.1007/978-3-319-04099-8_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5242
Parallel computation of the topology of level sets. Algorithmica, 2003. ,
Multi-resolution computation and presentation of contour trees ,
Robust on-line computation of Reeb graphs: simplicity and speed, ACM Transactions on Graphics (Proc. of ACM SIGGRAPH), vol.269, pp.58-59, 2007. ,
Sur les points singuliers d'une forme de Pfaffcompì etement intégrable ou d'une fonction numérique. Comptes-rendus de l, Académie des Sciences, vol.222, pp.847-849, 1946. ,
MCSTL: The Multi-core Standard Template Library, Euro-Par, 2007. ,
DOI : 10.1007/978-3-540-74466-5_72
Time-varying contour topology, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.1, 2006. ,
DOI : 10.1109/TVCG.2006.16
) steps, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, 1998. ,
DOI : 10.1145/276884.276892
Multiscale Symmetry Detection in Scalar Fields by Clustering Contours, Proc. of IEEE VIS, p.2014 ,
DOI : 10.1109/TVCG.2014.2346332
Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees, Proc. of IEEE VIS, pp.1177-1184, 2009. ,
DOI : 10.1109/TVCG.2009.163
URL : https://hal.archives-ouvertes.fr/hal-01211176
A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings., 2003. ,
DOI : 10.1109/EMPDP.2003.1183613
Contour trees and small seed sets for isosurface traversal, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, 1997. ,
DOI : 10.1145/262839.269238
Topology-Controlled Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.2, 2007. ,
DOI : 10.1109/TVCG.2007.47
Roofline, Communications of the ACM, vol.52, issue.4, pp.65-76, 2009. ,
DOI : 10.1145/1498765.1498785