Pausinger, F., &; Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. Physics Letters, Section A. Elsevier.https://doi.org/10.1016/j.physleta.2014.12.010 

Edelsbrunner, H., Jablonski, G., &; Mrozek, M. (2015). The persistent homology of a self-map. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-014-9223-y 

Attali, D., Bauer, U., Devillers, O., Glisse, M., &; Lieutier, A. (2015). Homological reconstruction and simplification in . Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2014.08.010 

Symonova, O., Topp, C., &; Edelsbrunner, H. (2015). DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0127657 

Symonova, O., Topp, C., &; Edelsbrunner, H. (2015). Root traits computed by DynamicRoots for the maize root shown in fig 2. Public Library of Science.https://doi.org/10.1371/journal.pone.0127657.s001 

Pausinger, F., &; Svane, A. (2015). A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. Academic Press.https://doi.org/10.1016/j.jco.2015.06.002 

Pausinger, F. (2015). On the approximation of intrinsic volumes. Institute of Science and Technology Austria.

Kasten, J., Reininghaus, J., Reich, W., &; Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, &; R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III  (Vol. 1, pp. 55–69). Cham: Springer.https://doi.org/10.1007/978-3-319-04099-8_4 

Huber, S., Held, M., Meerwald, P., &; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. World Scientific Publishing.https://doi.org/10.1142/S0218195914500034 

Cibulka, J., Gao, P., Krcál, M., Valla, T., &; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-014-9646-x 

Dolbilin, N., Edelsbrunner, H., Glazyrin, A., &; Musin, O. (2014). Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. Independent University of Moscow.https://doi.org/10.17323/1609-4514-2014-14-3-491-504 

Alexeev, V. V., Bogaevskaya, V. G., Preobrazhenskaya, M. M., Ukhalov, A. Y., Edelsbrunner, H., &; Yakimova, O. (2014). An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. Springer.https://doi.org/10.1007/s10958-014-2165-8 

Günther, D., Jacobson, A., Reininghaus, J., Seidel, H., Sorkine Hornung, O., &; Weinkauf, T. (2014). Fast and memory-efficient topological denoising of 2D and 3D scalar fields. IEEE Transactions on Visualization and Computer Graphics. IEEE.https://doi.org/10.1109/TVCG.2014.2346432 

Bauer, U., Kerber, M., &; Reininghaus, J. (2014). Distributed computation of persistent homology. In C.https://doi.org/10.1137/1.9781611973198.4__McGeoch &; U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 31–38). Portland, USA: Society of Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973198.4 

Bauer, U., Kerber, M., &; Reininghaus, J. (2014). Clear and Compress: Computing Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, &; R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (pp. 103–117). Springer.https://doi.org/10.1007/978-3-319-04099-8_7 

Bauer, U., &; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Annual Symposium on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582168 

Bauer, U., Ge, X., &; Wang, Y. (2014). Measuring distance between Reeb graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 464–473). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582169 

Bauer, U., &; Edelsbrunner, H. (2014). The morse theory of cech and Delaunay filtrations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 484–490). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582167 

Edelsbrunner, H., &; Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM.https://doi.org/10.1137/1.9781611973402.11 

cadek, M., Krcál, M., Matousek, J., Sergeraert, F., Vokínek, L., &; Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM.https://doi.org/10.1145/2597629 

Edelsbrunner, H., &; Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House.https://doi.org/10.4171/120-1/3 

Biedl, T., Huber, S., &; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature.https://doi.org/10.1007/978-3-319-13075-0_10 

Edelsbrunner, H. (2014). A Short Course in Computational Geometry and Topology (1st ed.). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-05957-0 

Zobel, V., Reininghaus, J., &; Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In Topological Methods in Data Analysis and Visualization III  (pp. 249–262). Springer.https://doi.org/10.1007/978-3-319-04099-8_16 

Günther, D., Reininghaus, J., Seidel, H.-P., &; Weinkauf, T. (2014). Notes on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V. Pascucci, &; R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III. (pp. 135–150). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-04099-8_9 

Edelsbrunner, H., &; Pausinger, F. (2014). Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. Springer.https://doi.org/10.1007/s10851-013-0468-x 

Bauer, U., Kerber, M., Reininghaus, J., &; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In ICMS 2014: International Congress on Mathematical Software (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-662-44199-2_24 

Iglesias Ham, M., Kerber, M., &; Uhler, C. (n.d.). Sphere packing with limited overlap. arXiv.https://doi.org/10.48550/arXiv.1401.0468 

Biedl, T., Held, M., &; Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE.https://doi.org/10.1109/ISVD.2013.11 

Biedl, T., Held, M., &; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In 29th European Workshop on Computational Geometry (pp. 95–98). Braunschweig, Germany: TU Braunschweig.

Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.endm.2013.07.008 

cadek, M., Krcál, M., Matousek, J., Vokínek, L., &; Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM.https://doi.org/10.1145/2488608.2488683 

Attali, D., Bauer, U., Devillers, O., Glisse, M., &; Lieutier, A. (2013). Homological reconstruction and simplification in . In Proceedings of the 29th annual symposium on Computational Geometry (pp. 117–125). Rio de Janeiro, Brazil: ACM.https://doi.org/10.1145/2462356.2462373 

Topp, C., Iyer Pascuzzi, A., Anderson, J., Lee, C., Zurek, P., Symonova, O.,https://doi.org/10.1073/pnas.1304354110__Benfey, P. (2013). 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1304354110 

Edelsbrunner, H., &; Pausinger, F. (2013). Stable length estimates of tube-like shapes. In 17th IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 7749, pp. XV–XIX). Seville, Spain: Springer.https://doi.org/10.1007/978-3-642-37067-0 

Bendich, P., Edelsbrunner, H., Morozov, D., &; Patel, A. (2013). Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. International Press.https://doi.org/10.4310/HHA.2013.v15.n1.a3 

Fang, S., Clark, R., Zheng, Y., Iyer Pascuzzi, A., Weitz, J., Kochian, L.,https://doi.org/10.1073/pnas.1222821110__Benfey, P. (2013). Genotypic recognition and spatial responses by rice roots. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1222821110 

Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &; Lampert, C. (2013). Computing the M most probable modes of a graphical model (Vol. 31, pp. 161–169). Presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States: JMLR.

Kerber, M., &; Edelsbrunner, H. (2013). 3D kinetic alpha complexes and their implementation. In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments (pp. 70–77). New Orleans, LA, United States: Society of Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611972931.6 

Edelsbrunner, H., Fasy, B. T., &; Rote, G. (2013). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-013-9517-x 

Chen, C., &; Kerber, M. (2013). An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2012.02.010 

Edelsbrunner, H. (2013). Persistent homology in image processing. In Graph-Based Representations in Pattern Recognition (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-38221-5_19 

Edelsbrunner, H., &; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing Ltd.https://doi.org/10.1070/RM2012v067n06ABEH004820 

Edelsbrunner, H., &; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE.https://doi.org/10.1109/ISVD.2012.11 

Dolbilin, N., Edelsbrunner, H., &; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. IOP Publishing.https://doi.org/10.1070/RM2012v067n04ABEH004807 

Zankl, G., Haxhimusa, Y., &; Ion, A. (2012). Interactive labeling of image segmentation hierarchies (Vol. 7476, pp. 11–20). Presented at the Pattern Recognition, Graz, Austria: Springer.https://doi.org/10.1007/978-3-642-32717-9_2 

Brown, G., Kerber, M., &; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. Cambridge University Press.https://doi.org/10.1112/S0010437X11007226 

Edelsbrunner, H., &; Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In Proceedings of the twenty-eighth annual symposium on Computational geometry  (pp. 249–258). Chapel Hill, NC, USA: ACM.https://doi.org/10.1145/2261250.2261287 

Edelsbrunner, H., Fasy, B., &; Rote, G. (2012). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In Proceedings of the twenty-eighth annual symposium on Computational geometry  (pp. 91–100). Chapel Hill, NC, USA: ACM.https://doi.org/10.1145/2261250.2261265 

Edelsbrunner, H., &; Kerber, M. (2012). Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9382-4 

Ion, A., Carreira, J., &; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126486 

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-012-9441-5 

Kerber, M., &; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. https://doi.org/10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/j.jsc.2011.11.001 

Busaryev, O., Cabello, S., Chen, C., Dey, T., &; Wang, Y. (2012). Annotating simplices with a homology basis and its applications (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer.https://doi.org/10.1007/978-3-642-31155-0_17 

Mileyko, Y., Edelsbrunner, H., Price, C., &; Weitz, J. (2012). Hierarchical ordering of reticular networks. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0036715 

Bendich, P., Cabello, S., &; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier.https://doi.org/10.1016/j.patrec.2011.10.007 

Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. B. Verkin Institute for Low Temperature Physics and Engineering.

Edelsbrunner, H., &; Strelkova, N. (2012). On the configuration space for the shortest networks. Russian Mathematical Surveys. Russian Academy of Sciences.https://doi.org/10.4213/rm9503 

Quadrianto, N., Lampert, C., &; Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In Proceedings of the 29th International Conference on Machine Learning (pp. 211–218). Edinburgh, United Kingdom: ML Research Press.

Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux.https://doi.org/10.5802/jtnb.819 

Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V.,  Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. Russian Academy of Sciences.

Ion, A., Carreira, J., &; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In NIPS Proceedings (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation.

Sheng, Y., Cutler, B., Chen, C., &; Nasman, J. (2011). Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. Wiley-Blackwell.https://doi.org/10.1111/j.1467-8659.2011.01985.x 

Chen, C., &; Freedman, D. (2011). Hardness results for homology localization. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-010-9322-8 

Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C.,https://doi.org/10.1007/978-3-642-25249-5_3__Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, &; M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer.https://doi.org/10.1007/978-3-642-25249-5_3 

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM.https://doi.org/10.1145/1998196.1998225 

Kerber, M., &; Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer.https://doi.org/10.1007/s00373-011-1020-7 

Kerber, M., &; Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer.https://doi.org/10.1145/1993886.1993920 

Berberich, E., Hemmer, M., &; Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM.https://doi.org/10.1145/1998196.1998224 

Edelsbrunner, H., Pach, J., &; Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-010-9313-9 

Chen, C., &; Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM.https://doi.org/10.1145/1998196.1998228 

Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Sci. Math. (Szeged). Szegedi Tudományegyetem.

Edelsbrunner, H., &; Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &; A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer.https://doi.org/10.1007/978-3-642-19391-0_2 

Wang, B., Edelsbrunner, H., &; Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM.https://doi.org/10.1145/1963190.1970375 

Wagner, H., Chen, C., &; Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, &; R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 91–106). Springer.https://doi.org/10.1007/978-3-642-23175-9_7 

Chen, C., &; Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.

Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., &; Benfey, P. (2011). Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126475 

Chen, C., &; Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126271 

Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, &; V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.

Edelsbrunner, H., Morozov, D., &; Patel, A. (2011). Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-011-9090-8 

Bendich, P., &; Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-010-9081-1 

Chen, C., Freedman, D., &; Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. In CVPR: Computer Vision and Pattern Recognition (pp. 2089–2096). Colorado Springs, CO, United States: IEEE.https://doi.org/10.1109/CVPR.2011.5995503 

Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &; Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In Computer Analysis of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature.https://doi.org/10.1007/978-3-642-23672-3_35 

Artner, N. M., Ion, A., &; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &; A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-20844-7_22 

Chen, C., &; Freedman, D. (2010). Hardness results for homology localization. In Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973075.129 

Chen, C., &; Freedman, D. (2010). Topology noise removal for curve  and surface evolution. In https://doi.org/10.1007/978-3-642-18421-5_4__Conference proceedings MCV 2010 (Vol. 6533, pp. 31–42). Beijing, China: Springer.https://doi.org/10.1007/978-3-642-18421-5_4 

Edelsbrunner, H., Morozov, D., &; Patel, A. (2010). The stability of the apparent contour of an orientable 2-manifold. In Topological Data Analysis and Visualization: Theory, Algorithms and Applications (pp. 27–42). Springer.https://doi.org/10.1007/978-3-642-15014-2_3 

Bendich, P., Edelsbrunner, H., Morozov, D., &; Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer.https://doi.org/10.1007/978-3-642-15775-2_1 

Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_19 

Bendich, P., Edelsbrunner, H., Kerber, M., &; Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_2 

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.

Bendich, P., Edelsbrunner, H., &; Kerber, M. (2010). Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. IEEE.https://doi.org/10.1109/TVCG.2010.139 

Edelsbrunner, H., &; Harer, J. (2009). The persistent Morse complex segmentation of a 3-manifold (Vol. 5903, pp. 36–50). Presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland: Springer.https://doi.org/10.1007/978-3-642-10470-1_4