[{"publication":"Journal of Mathematical Sciences","month":"11","oa_version":"None","language":[{"iso":"eng"}],"date_published":"2014-11-16T00:00:00Z","type":"journal_article","publist_id":"5165","publication_identifier":{"eissn":["1573-8795"],"issn":["1072-3374"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"V V","last_name":"Alexeev","full_name":"Alexeev, V V"},{"full_name":"Bogaevskaya, V G","first_name":"V G","last_name":"Bogaevskaya"},{"first_name":"M M","last_name":"Preobrazhenskaya","full_name":"Preobrazhenskaya, M M"},{"first_name":"A Y","last_name":"Ukhalov","full_name":"Ukhalov, A Y"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olga","last_name":"Yakimova","full_name":"Yakimova, Olga"}],"issue":"6","_id":"1929","scopus_import":"1","title":"An algorithm for cartographic generalization that preserves global topology","intvolume":"       203","publication_status":"published","date_created":"2018-12-11T11:54:46Z","article_processing_charge":"No","department":[{"_id":"HeEd"}],"page":"754 - 760","quality_controlled":"1","article_type":"original","publisher":"Springer","date_updated":"2022-05-24T10:39:06Z","citation":{"ista":"Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. 203(6), 754–760.","mla":"Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” <i>Journal of Mathematical Sciences</i>, vol. 203, no. 6, Springer, 2014, pp. 754–60, doi:<a href=\"https://doi.org/10.1007/s10958-014-2165-8\">10.1007/s10958-014-2165-8</a>.","short":"V.V. Alexeev, V.G. Bogaevskaya, M.M. Preobrazhenskaya, A.Y. Ukhalov, H. Edelsbrunner, O. Yakimova, Journal of Mathematical Sciences 203 (2014) 754–760.","ieee":"V. V. Alexeev, V. G. Bogaevskaya, M. M. Preobrazhenskaya, A. Y. Ukhalov, H. Edelsbrunner, and O. Yakimova, “An algorithm for cartographic generalization that preserves global topology,” <i>Journal of Mathematical Sciences</i>, vol. 203, no. 6. Springer, pp. 754–760, 2014.","chicago":"Alexeev, V V, V G Bogaevskaya, M M Preobrazhenskaya, A Y Ukhalov, Herbert Edelsbrunner, and Olga Yakimova. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” <i>Journal of Mathematical Sciences</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10958-014-2165-8\">https://doi.org/10.1007/s10958-014-2165-8</a>.","apa":"Alexeev, V. V., Bogaevskaya, V. G., Preobrazhenskaya, M. M., Ukhalov, A. Y., Edelsbrunner, H., &#38; Yakimova, O. (2014). An algorithm for cartographic generalization that preserves global topology. <i>Journal of Mathematical Sciences</i>. Springer. <a href=\"https://doi.org/10.1007/s10958-014-2165-8\">https://doi.org/10.1007/s10958-014-2165-8</a>","ama":"Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. An algorithm for cartographic generalization that preserves global topology. <i>Journal of Mathematical Sciences</i>. 2014;203(6):754-760. doi:<a href=\"https://doi.org/10.1007/s10958-014-2165-8\">10.1007/s10958-014-2165-8</a>"},"year":"2014","abstract":[{"text":"We propose an algorithm for the generalization of cartographic objects that can be used to represent maps on different scales.","lang":"eng"}],"doi":"10.1007/s10958-014-2165-8","day":"16","volume":203,"acknowledgement":"We would like to offer our special thanks to students of the Department of Mathematics of Demidov Yaroslavl State University A. A. Gorokhov and V. N. Knyazev for participation in developing the program and assistance in preparation of test data. This work was supported by grant 11.G34.31.0053 from the government of the Russian Federation."},{"volume":20,"acknowledgement":"RTRA Digiteoproject; ERC grant; SNF award; Intel Doctoral Fellowship; MPC-VCC","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2014","citation":{"ama":"Günther D, Jacobson A, Reininghaus J, Seidel H, Sorkine Hornung O, Weinkauf T. Fast and memory-efficient topological denoising of 2D and 3D scalar fields. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2014;20(12):2585-2594. doi:<a href=\"https://doi.org/10.1109/TVCG.2014.2346432\">10.1109/TVCG.2014.2346432</a>","apa":"Günther, D., Jacobson, A., Reininghaus, J., Seidel, H., Sorkine Hornung, O., &#38; Weinkauf, T. (2014). Fast and memory-efficient topological denoising of 2D and 3D scalar fields. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2014.2346432\">https://doi.org/10.1109/TVCG.2014.2346432</a>","ieee":"D. Günther, A. Jacobson, J. Reininghaus, H. Seidel, O. Sorkine Hornung, and T. Weinkauf, “Fast and memory-efficient topological denoising of 2D and 3D scalar fields,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 20, no. 12. IEEE, pp. 2585–2594, 2014.","chicago":"Günther, David, Alec Jacobson, Jan Reininghaus, Hans Seidel, Olga Sorkine Hornung, and Tino Weinkauf. “Fast and Memory-Efficient Topological Denoising of 2D and 3D Scalar Fields.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/TVCG.2014.2346432\">https://doi.org/10.1109/TVCG.2014.2346432</a>.","mla":"Günther, David, et al. “Fast and Memory-Efficient Topological Denoising of 2D and 3D Scalar Fields.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 20, no. 12, IEEE, 2014, pp. 2585–94, doi:<a href=\"https://doi.org/10.1109/TVCG.2014.2346432\">10.1109/TVCG.2014.2346432</a>.","short":"D. Günther, A. Jacobson, J. Reininghaus, H. Seidel, O. Sorkine Hornung, T. Weinkauf, IEEE Transactions on Visualization and Computer Graphics 20 (2014) 2585–2594.","ista":"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. 20(12), 2585–2594."},"date_updated":"2021-01-12T06:54:09Z","type":"journal_article","date_published":"2014-12-31T00:00:00Z","day":"31","doi":"10.1109/TVCG.2014.2346432","publist_id":"5164","abstract":[{"lang":"eng","text":"(Figure Presented) Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications."}],"quality_controlled":"1","page":"2585 - 2594","language":[{"iso":"eng"}],"publisher":"IEEE","scopus_import":1,"publication":"IEEE Transactions on Visualization and Computer Graphics","_id":"1930","issue":"12","author":[{"full_name":"Günther, David","last_name":"Günther","first_name":"David"},{"full_name":"Jacobson, Alec","last_name":"Jacobson","first_name":"Alec"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","last_name":"Reininghaus","first_name":"Jan"},{"last_name":"Seidel","first_name":"Hans","full_name":"Seidel, Hans"},{"full_name":"Sorkine Hornung, Olga","first_name":"Olga","last_name":"Sorkine Hornung"},{"first_name":"Tino","last_name":"Weinkauf","full_name":"Weinkauf, Tino"}],"date_created":"2018-12-11T11:54:46Z","department":[{"_id":"HeEd"}],"publication_status":"published","oa_version":"None","intvolume":"        20","title":"Fast and memory-efficient topological denoising of 2D and 3D scalar fields","month":"12"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Herbert Edelsbrunner for his valuable discussions and ideas on the topic of this paper.  The second author has been supported by the Max Planck Center for Visual Computing and Communication","main_file_link":[{"url":"http://cccg.ca/proceedings/2014/papers/paper23.pdf","open_access":"1"}],"abstract":[{"text":"The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice.","lang":"eng"}],"publist_id":"5064","oa":1,"arxiv":1,"doi":"10.48550/arXiv.1401.0468","day":"01","date_published":"2014-01-01T00:00:00Z","type":"preprint","external_id":{"arxiv":["1401.0468"]},"date_updated":"2023-10-18T08:06:45Z","citation":{"ieee":"M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” <i>arXiv</i>. .","chicago":"Iglesias Ham, Mabel, Michael Kerber, and Caroline Uhler. “Sphere Packing with Limited Overlap.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1401.0468\">https://doi.org/10.48550/arXiv.1401.0468</a>.","ama":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1401.0468\">10.48550/arXiv.1401.0468</a>","apa":"Iglesias Ham, M., Kerber, M., &#38; Uhler, C. (n.d.). Sphere packing with limited overlap. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1401.0468\">https://doi.org/10.48550/arXiv.1401.0468</a>","ista":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468.","mla":"Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.” <i>ArXiv</i>, 1401.0468, doi:<a href=\"https://doi.org/10.48550/arXiv.1401.0468\">10.48550/arXiv.1401.0468</a>.","short":"M. Iglesias Ham, M. Kerber, C. Uhler, ArXiv (n.d.)."},"year":"2014","language":[{"iso":"eng"}],"title":"Sphere packing with limited overlap","month":"01","article_number":"1401.0468","oa_version":"Submitted Version","publication_status":"submitted","article_processing_charge":"No","date_created":"2018-12-11T11:55:12Z","department":[{"_id":"HeEd"},{"_id":"CaUh"}],"author":[{"full_name":"Iglesias Ham, Mabel","first_name":"Mabel","last_name":"Iglesias Ham","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","first_name":"Caroline","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216"}],"_id":"2012","publication":"arXiv"},{"oa":1,"publist_id":"5008","type":"conference","date_published":"2014-01-01T00:00:00Z","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.0710"}],"month":"01","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","publication":"Proceedings of the Workshop on Algorithm Engineering and Experiments","conference":{"end_date":"2014-01-05","location":"Portland, USA","name":"ALENEX: Algorithm Engineering and Experiments","start_date":"2014-01-05"},"language":[{"iso":"eng"}],"abstract":[{"text":"Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems [1], we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (109) elements within seconds on a cluster with 32 nodes using less than 6GB of memory per node.","lang":"eng"}],"day":"01","doi":"10.1137/1.9781611973198.4","citation":{"ista":"Bauer U, Kerber M, Reininghaus J. 2014. Distributed computation of persistent homology. Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, 31–38.","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, C.  McGeoch, U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2014, pp. 31–38.","mla":"Bauer, Ulrich, et al. “Distributed Computation of Persistent Homology.” <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, edited by Catherine  McGeoch and Ulrich Meyer, Society of Industrial and Applied Mathematics, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.1137/1.9781611973198.4\">10.1137/1.9781611973198.4</a>.","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent homology,” in <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, Portland, USA, 2014, pp. 31–38.","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Distributed Computation of Persistent Homology.” In <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>, edited by Catherine  McGeoch and Ulrich Meyer, 31–38. Society of Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973198.4\">https://doi.org/10.1137/1.9781611973198.4</a>.","ama":"Bauer U, Kerber M, Reininghaus J. Distributed computation of persistent homology. In:  McGeoch C, Meyer U, eds. <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i>. Society of Industrial and Applied Mathematics; 2014:31-38. doi:<a href=\"https://doi.org/10.1137/1.9781611973198.4\">10.1137/1.9781611973198.4</a>","apa":"Bauer, U., Kerber, M., &#38; Reininghaus, J. (2014). Distributed computation of persistent homology. In C.  McGeoch &#38; U. Meyer (Eds.), <i>Proceedings of the Workshop on Algorithm Engineering and Experiments</i> (pp. 31–38). Portland, USA: Society of Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973198.4\">https://doi.org/10.1137/1.9781611973198.4</a>"},"year":"2014","date_updated":"2021-01-12T06:54:56Z","title":"Distributed computation of persistent homology","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:55:23Z","publication_status":"published","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","first_name":"Michael","last_name":"Kerber"},{"last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"_id":"2043","editor":[{"full_name":" McGeoch, Catherine","first_name":"Catherine","last_name":" McGeoch"},{"full_name":"Meyer, Ulrich","first_name":"Ulrich","last_name":"Meyer"}],"publisher":"Society of Industrial and Applied Mathematics","quality_controlled":"1","ec_funded":1,"page":"31 - 38"},{"citation":{"ista":"Bauer U, Kerber M, Reininghaus J. 2014.Clear and Compress: Computing Persistent Homology in Chunks. In: Topological Methods in Data Analysis and Visualization III. , 103–117.","mla":"Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in Chunks.” <i>Topological Methods in Data Analysis and Visualization III</i>, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">10.1007/978-3-319-04099-8_7</a>.","short":"U. Bauer, M. Kerber, J. Reininghaus, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III, Springer, 2014, pp. 103–117.","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Clear and Compress: Computing Persistent Homology in Chunks.” In <i>Topological Methods in Data Analysis and Visualization III</i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 103–17. Mathematics and Visualization. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">https://doi.org/10.1007/978-3-319-04099-8_7</a>.","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in <i>Topological Methods in Data Analysis and Visualization III</i>, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Springer, 2014, pp. 103–117.","ama":"Bauer U, Kerber M, Reininghaus J. Clear and Compress: Computing Persistent Homology in Chunks. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III</i>. Mathematics and Visualization. Springer; 2014:103-117. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">10.1007/978-3-319-04099-8_7</a>","apa":"Bauer, U., Kerber, M., &#38; Reininghaus, J. (2014). Clear and Compress: Computing Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III</i> (pp. 103–117). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_7\">https://doi.org/10.1007/978-3-319-04099-8_7</a>"},"year":"2014","date_updated":"2021-01-12T06:54:56Z","day":"19","doi":"10.1007/978-3-319-04099-8_7","abstract":[{"text":"We present a parallel algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques, which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we further improve the performance through parallel computation.","lang":"eng"}],"quality_controlled":"1","series_title":"Mathematics and Visualization","ec_funded":1,"page":"103 - 117","editor":[{"full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo","last_name":"Bremer"},{"last_name":"Hotz","first_name":"Ingrid","full_name":"Hotz, Ingrid"},{"full_name":"Pascucci, Valerio","first_name":"Valerio","last_name":"Pascucci"},{"first_name":"Ronald","last_name":"Peikert","full_name":"Peikert, Ronald"}],"publisher":"Springer","scopus_import":1,"_id":"2044","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael"},{"last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:55:23Z","department":[{"_id":"HeEd"}],"publication_status":"published","title":"Clear and Compress: Computing Persistent Homology in Chunks","main_file_link":[{"url":"http://arxiv.org/abs/1303.0477","open_access":"1"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","type":"book_chapter","date_published":"2014-03-19T00:00:00Z","oa":1,"publist_id":"5007","language":[{"iso":"eng"}],"publication":"Topological Methods in Data Analysis and Visualization III","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"oa_version":"Submitted Version","month":"03"},{"main_file_link":[{"url":"http://arxiv.org/abs/1311.3681","open_access":"1"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","day":"01","doi":"10.1145/2582112.2582168","oa":1,"publist_id":"4853","abstract":[{"text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s).","lang":"eng"}],"citation":{"short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>."},"year":"2014","date_updated":"2021-01-12T06:55:38Z","type":"conference","date_published":"2014-06-01T00:00:00Z","publisher":"ACM","conference":{"location":"Kyoto, Japan","end_date":"2014-06-11","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry"},"ec_funded":1,"quality_controlled":"1","page":"355 - 364","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:01Z","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"HeEd"}],"publication_status":"published","oa_version":"Submitted Version","month":"06","title":"Induced matchings of barcodes and the algebraic stability of persistence","scopus_import":1,"_id":"2153","publication":"Proceedings of the Annual Symposium on Computational Geometry","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich"},{"full_name":"Lesnick, Michael","first_name":"Michael","last_name":"Lesnick"}]},{"date_created":"2018-12-11T11:56:01Z","department":[{"_id":"HeEd"}],"publication_status":"published","title":"The morse theory of Čech and Delaunay filtrations","scopus_import":1,"_id":"2155","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich","last_name":"Bauer"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"ACM","ec_funded":1,"quality_controlled":"1","page":"484 - 490","day":"01","doi":"10.1145/2582112.2582167","abstract":[{"text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s).","lang":"eng"}],"citation":{"mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490."},"year":"2014","date_updated":"2021-01-12T06:55:38Z","acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","month":"06","publication":"Proceedings of the Annual Symposium on Computational Geometry","conference":{"start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","location":"Kyoto, Japan"},"language":[{"iso":"eng"}],"publist_id":"4851","oa":1,"type":"conference","date_published":"2014-06-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"language":[{"iso":"eng"}],"month":"06","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"oa_version":"Submitted Version","publication":"Proceedings of the Annual Symposium on Computational Geometry","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"publist_id":"4850","oa":1,"type":"conference","date_published":"2014-06-01T00:00:00Z","publisher":"ACM","quality_controlled":"1","ec_funded":1,"page":"464 - 473","title":"Measuring distance between Reeb graphs","date_created":"2018-12-11T11:56:02Z","department":[{"_id":"HeEd"}],"publication_status":"published","author":[{"orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich","last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ge, Xiaoyin","last_name":"Ge","first_name":"Xiaoyin"},{"first_name":"Yusu","last_name":"Wang","full_name":"Wang, Yusu"}],"scopus_import":1,"_id":"2156","acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","abstract":[{"text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).","lang":"eng"}],"day":"01","doi":"10.1145/2582112.2582169","year":"2014","citation":{"ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>"},"date_updated":"2021-01-12T06:55:39Z"},{"conference":{"location":"Portland, USA","end_date":"2014-01-07","start_date":"2014-01-05","name":"SODA: Symposium on Discrete Algorithms"},"publisher":"SIAM","language":[{"iso":"eng"}],"page":"152 - 160","quality_controlled":"1","title":"On the computational complexity of betti numbers reductions from matrix rank","month":"01","oa_version":"None","publication_status":"published","date_created":"2018-12-11T11:56:09Z","department":[{"_id":"HeEd"}],"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Parsa, Salman","first_name":"Salman","last_name":"Parsa","id":"4BDBD4F2-F248-11E8-B48F-1D18A9856A87"}],"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","_id":"2177","scopus_import":1,"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity.","lang":"eng"}],"publist_id":"4805","doi":"10.1137/1.9781611973402.11","day":"01","date_published":"2014-01-01T00:00:00Z","type":"conference","date_updated":"2021-01-12T06:55:48Z","year":"2014","citation":{"ieee":"H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, USA, 2014, pp. 152–160.","chicago":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 152–60. SIAM, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>.","apa":"Edelsbrunner, H., &#38; Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 152–160). Portland, USA: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>","ama":"Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2014:152-160. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>","ista":"Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.","mla":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2014, pp. 152–60, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>.","short":"H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160."}},{"month":"05","article_number":"17 ","oa_version":"Preprint","publication":"Journal of the ACM","language":[{"iso":"eng"}],"oa":1,"publist_id":"4797","date_published":"2014-05-01T00:00:00Z","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1105.6257"}],"title":"Computing all maps into a sphere","intvolume":"        61","publication_status":"published","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_created":"2018-12-11T11:56:12Z","author":[{"first_name":"Martin","last_name":"Čadek","full_name":"Čadek, Martin"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Krcál","full_name":"Krcál, Marek"},{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"last_name":"Sergeraert","first_name":"Francis","full_name":"Sergeraert, Francis"},{"first_name":"Lukáš","last_name":"Vokřínek","full_name":"Vokřínek, Lukáš"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"issue":"3","_id":"2184","scopus_import":1,"publisher":"ACM","quality_controlled":"1","abstract":[{"lang":"eng","text":"Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable."}],"doi":"10.1145/2597629","day":"01","date_updated":"2021-01-12T06:55:50Z","citation":{"apa":"Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., &#38; Wagner, U. (2014). Computing all maps into a sphere. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>","ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>.","mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>, vol. 61, no. 3, 17, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","ista":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17."},"year":"2014","volume":61,"acknowledgement":"The research by M. K. was supported by project GAUK 49209. The research by M. K. was also supported by project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague (project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948)."},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2843"},{"relation":"dissertation_contains","id":"1399","status":"public"}]},"file":[{"file_id":"5204","creator":"system","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:16:18Z","file_size":3941391,"checksum":"2f93f3e63a38a85cd4404d7953913b14"}],"date_published":"2014-09-01T00:00:00Z","type":"journal_article","publist_id":"4691","oa":1,"publication_identifier":{"issn":["09249907"]},"language":[{"iso":"eng"}],"publication":"Journal of Mathematical Imaging and Vision","has_accepted_license":"1","month":"09","oa_version":"Submitted Version","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"volume":50,"date_updated":"2023-09-07T11:41:25Z","year":"2014","citation":{"short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>.","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. 2014;50(1):164-177. doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>","apa":"Edelsbrunner, H., &#38; Pausinger, F. (2014). Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1. Springer, pp. 164–177, 2014.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>."},"abstract":[{"text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm.","lang":"eng"}],"doi":"10.1007/s10851-013-0468-x","day":"01","file_date_updated":"2020-07-14T12:45:35Z","page":"164 - 177","ec_funded":1,"quality_controlled":"1","publisher":"Springer","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","last_name":"Pausinger","first_name":"Florian"}],"issue":"1","_id":"2255","scopus_import":1,"title":"Stable length estimates of tube-like shapes","pubrep_id":"549","intvolume":"        50","publication_status":"published","date_created":"2018-12-11T11:56:36Z","department":[{"_id":"HeEd"}]},{"doi":"10.1007/978-3-319-05957-0","edition":"1","day":"01","publication_identifier":{"isbn":["9-783-3190-5956-3"],"eisbn":["9-783-3190-5957-0"],"issn":["2191-530X"],"eissn":["2191-5318"]},"abstract":[{"lang":"eng","text":"This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields."}],"date_updated":"2022-03-04T07:47:54Z","citation":{"chicago":"Edelsbrunner, Herbert. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed. SpringerBriefs in Applied Sciences and Technology. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05957-0\">https://doi.org/10.1007/978-3-319-05957-0</a>.","ieee":"H. Edelsbrunner, <i>A Short Course in Computational Geometry and Topology</i>, 1st ed. Cham: Springer Nature, 2014.","ama":"Edelsbrunner H. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed. Cham: Springer Nature; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-319-05957-0\">10.1007/978-3-319-05957-0</a>","apa":"Edelsbrunner, H. (2014). <i>A Short Course in Computational Geometry and Topology</i> (1st ed.). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-05957-0\">https://doi.org/10.1007/978-3-319-05957-0</a>","ista":"Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p.","short":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.","mla":"Edelsbrunner, Herbert. <i>A Short Course in Computational Geometry and Topology</i>. 1st ed., Springer Nature, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-319-05957-0\">10.1007/978-3-319-05957-0</a>."},"year":"2014","date_published":"2014-01-01T00:00:00Z","type":"book","place":"Cham","related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=356106","relation":"other","description":"available as eBook via catalog IST BookList"},{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=373842","relation":"other","description":"available via catalog IST BookList"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","oa_version":"None","department":[{"_id":"HeEd"}],"article_processing_charge":"No","date_created":"2019-09-06T09:22:33Z","month":"01","alternative_title":["SpringerBriefs in Applied Sciences and Technology"],"title":"A Short Course in Computational Geometry and Topology","_id":"6853","scopus_import":"1","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer Nature","page":"IX, 110","quality_controlled":"1","series_title":"SpringerBriefs in Applied Sciences and Technology","language":[{"iso":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"content_type":"application/pdf","file_name":"IST-2016-533-v1+1_Extending_continuous_maps_polynomiality_and_undecidability.pdf","date_updated":"2020-07-14T12:45:48Z","checksum":"06c2ce5c1135fbc1f71ca15eeb242dcf","file_size":447945,"date_created":"2018-12-12T10:14:29Z","creator":"system","file_id":"5081","access_level":"open_access","relation":"main_file"}],"date_published":"2013-06-01T00:00:00Z","type":"conference","oa":1,"publist_id":"4078","language":[{"iso":"eng"}],"conference":{"location":"Palo Alto, CA, United States","end_date":"2013-06-04","start_date":"2013-06-01","name":"STOC: Symposium on the Theory of Computing"},"publication":"45th Annual ACM Symposium on theory of computing","has_accepted_license":"1","month":"06","oa_version":"Submitted Version","ddc":["510"],"date_updated":"2021-01-12T06:59:51Z","year":"2013","citation":{"ista":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.","mla":"Čadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.” <i>45th Annual ACM Symposium on Theory of Computing</i>, ACM, 2013, pp. 595–604, doi:<a href=\"https://doi.org/10.1145/2488608.2488683\">10.1145/2488608.2488683</a>.","short":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.","ieee":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in <i>45th Annual ACM Symposium on theory of computing</i>, Palo Alto, CA, United States, 2013, pp. 595–604.","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In <i>45th Annual ACM Symposium on Theory of Computing</i>, 595–604. ACM, 2013. <a href=\"https://doi.org/10.1145/2488608.2488683\">https://doi.org/10.1145/2488608.2488683</a>.","apa":"Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., &#38; Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In <i>45th Annual ACM Symposium on theory of computing</i> (pp. 595–604). Palo Alto, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2488608.2488683\">https://doi.org/10.1145/2488608.2488683</a>","ama":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: <i>45th Annual ACM Symposium on Theory of Computing</i>. ACM; 2013:595-604. doi:<a href=\"https://doi.org/10.1145/2488608.2488683\">10.1145/2488608.2488683</a>"},"abstract":[{"lang":"eng","text":"We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \\no holes up to dimension k-1&quot; (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. "}],"doi":"10.1145/2488608.2488683","day":"01","file_date_updated":"2020-07-14T12:45:48Z","page":"595 - 604","quality_controlled":"1","publisher":"ACM","author":[{"full_name":"Čadek, Martin","first_name":"Martin","last_name":"Čadek"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek","first_name":"Marek","last_name":"Krcál"},{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"first_name":"Lukáš","last_name":"Vokřínek","full_name":"Vokřínek, Lukáš"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"_id":"2807","scopus_import":1,"title":"Extending continuous maps: Polynomiality and undecidability","pubrep_id":"533","publication_status":"published","date_created":"2018-12-11T11:59:42Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}]},{"publisher":"ACM","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2013-06-17","end_date":"2013-06-20","location":"Rio de Janeiro, Brazil"},"page":"117 - 125","quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","publication_status":"published","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:59:44Z","month":"06","title":"Homological reconstruction and simplification in R3","publication":"Proceedings of the 29th annual symposium on Computational Geometry","_id":"2812","scopus_import":1,"author":[{"full_name":"Attali, Dominique","first_name":"Dominique","last_name":"Attali"},{"last_name":"Bauer","first_name":"Ulrich","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olivier","last_name":"Devillers","full_name":"Devillers, Olivier"},{"full_name":"Glisse, Marc","last_name":"Glisse","first_name":"Marc"},{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"}],"acknowledgement":"Some of the authors were partially supported by the GIGA ANR grant (contract ANR-09-BLAN-0331-01) and the European project CG-Learning (contract 255827).","main_file_link":[{"open_access":"1","url":"http://hal.archives-ouvertes.fr/hal-00833791/"}],"related_material":{"record":[{"status":"public","id":"1805","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","doi":"10.1145/2462356.2462373","day":"01","abstract":[{"lang":"eng","text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H* (X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in ℝ3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard."}],"oa":1,"publist_id":"4072","date_updated":"2023-02-23T10:15:15Z","year":"2013","citation":{"short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, in:, Proceedings of the 29th Annual Symposium on Computational Geometry, ACM, 2013, pp. 117–125.","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>, ACM, 2013, pp. 117–25, doi:<a href=\"https://doi.org/10.1145/2462356.2462373\">10.1145/2462356.2462373</a>.","ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2013. Homological reconstruction and simplification in R3. Proceedings of the 29th annual symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 117–125.","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. In: <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>. ACM; 2013:117-125. doi:<a href=\"https://doi.org/10.1145/2462356.2462373\">10.1145/2462356.2462373</a>","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., &#38; Lieutier, A. (2013). Homological reconstruction and simplification in R3. In <i>Proceedings of the 29th annual symposium on Computational Geometry</i> (pp. 117–125). Rio de Janeiro, Brazil: ACM. <a href=\"https://doi.org/10.1145/2462356.2462373\">https://doi.org/10.1145/2462356.2462373</a>","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” in <i>Proceedings of the 29th annual symposium on Computational Geometry</i>, Rio de Janeiro, Brazil, 2013, pp. 117–125.","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” In <i>Proceedings of the 29th Annual Symposium on Computational Geometry</i>, 117–25. ACM, 2013. <a href=\"https://doi.org/10.1145/2462356.2462373\">https://doi.org/10.1145/2462356.2462373</a>."},"date_published":"2013-06-01T00:00:00Z","type":"conference"},{"title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","intvolume":"        49","publication_status":"published","article_processing_charge":"No","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:59:44Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fasy, Brittany Terese","last_name":"Fasy","first_name":"Brittany Terese","id":"F65D502E-E68D-11E9-9252-C644099818F6"},{"last_name":"Rote","first_name":"Günter","full_name":"Rote, Günter"}],"issue":"4","_id":"2815","scopus_import":"1","article_type":"original","publisher":"Springer","page":"797 - 822","quality_controlled":"1","abstract":[{"lang":"eng","text":"The fact that a sum of isotropic Gaussian kernels can have more modes than kernels is surprising. Extra (ghost) modes do not exist in ℝ1 and are generally not well studied in higher dimensions. We study a configuration of n+1 Gaussian kernels for which there are exactly n+2 modes. We show that all modes lie on a finite set of lines, which we call axes, and study the restriction of the Gaussian mixture to these axes in order to discover that there are an exponential number of critical points in this configuration. Although the existence of ghost modes remained unknown due to the difficulty of finding examples in ℝ2, we show that the resilience of ghost modes grows like the square root of the dimension. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes."}],"doi":"10.1007/s00454-013-9517-x","day":"01","date_updated":"2023-02-23T11:13:49Z","year":"2013","citation":{"ista":"Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &#38; Computational Geometry. 49(4), 797–822.","mla":"Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Discrete &#38; Computational Geometry</i>, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi:<a href=\"https://doi.org/10.1007/s00454-013-9517-x\">10.1007/s00454-013-9517-x</a>.","short":"H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete &#38; Computational Geometry 49 (2013) 797–822.","ieee":"H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” <i>Discrete &#38; Computational Geometry</i>, vol. 49, no. 4. Springer, pp. 797–822, 2013.","chicago":"Edelsbrunner, Herbert, Brittany Terese Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00454-013-9517-x\">https://doi.org/10.1007/s00454-013-9517-x</a>.","apa":"Edelsbrunner, H., Fasy, B. T., &#38; Rote, G. (2013). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-013-9517-x\">https://doi.org/10.1007/s00454-013-9517-x</a>","ama":"Edelsbrunner H, Fasy BT, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. <i>Discrete &#38; Computational Geometry</i>. 2013;49(4):797-822. doi:<a href=\"https://doi.org/10.1007/s00454-013-9517-x\">10.1007/s00454-013-9517-x</a>"},"volume":49,"acknowledgement":"This research is partially supported by the National Science Foundation (NSF) under Grant DBI-0820624, by the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.","month":"06","oa_version":"Published Version","publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}],"publist_id":"3991","oa":1,"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"date_published":"2013-06-01T00:00:00Z","type":"journal_article","related_material":{"record":[{"id":"3134","relation":"earlier_version","status":"public"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-013-9517-x"}]},{"language":[{"iso":"eng"}],"month":"04","oa_version":"Submitted Version","publication":"PNAS","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4378147/","open_access":"1"}],"oa":1,"publist_id":"3979","date_published":"2013-04-30T00:00:00Z","type":"journal_article","publisher":"National Academy of Sciences","page":"E1695 - E1704","quality_controlled":"1","title":"3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture","intvolume":"       110","publication_status":"published","date_created":"2018-12-11T11:59:47Z","department":[{"_id":"MaJö"},{"_id":"HeEd"}],"author":[{"first_name":"Christopher","last_name":"Topp","full_name":"Topp, Christopher"},{"full_name":"Iyer Pascuzzi, Anjali","first_name":"Anjali","last_name":"Iyer Pascuzzi"},{"full_name":"Anderson, Jill","last_name":"Anderson","first_name":"Jill"},{"full_name":"Lee, Cheng","first_name":"Cheng","last_name":"Lee"},{"last_name":"Zurek","first_name":"Paul","full_name":"Zurek, Paul"},{"first_name":"Olga","last_name":"Symonova","full_name":"Symonova, Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zheng","first_name":"Ying","full_name":"Zheng, Ying"},{"first_name":"Alexander","last_name":"Bucksch","full_name":"Bucksch, Alexander"},{"full_name":"Mileyko, Yuriy","last_name":"Mileyko","first_name":"Yuriy"},{"full_name":"Galkovskyi, Taras","first_name":"Taras","last_name":"Galkovskyi"},{"first_name":"Brad","last_name":"Moore","full_name":"Moore, Brad"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mitchell Olds, Thomas","first_name":"Thomas","last_name":"Mitchell Olds"},{"full_name":"Weitz, Joshua","first_name":"Joshua","last_name":"Weitz"},{"last_name":"Benfey","first_name":"Philip","full_name":"Benfey, Philip"}],"issue":"18","_id":"2822","pmid":1,"scopus_import":1,"volume":110,"abstract":[{"lang":"eng","text":"Identification of genes that control root system architecture in crop plants requires innovations that enable high-throughput and accurate measurements of root system architecture through time. We demonstrate the ability of a semiautomated 3D in vivo imaging and digital phenotyping pipeline to interrogate the quantitative genetic basis of root system growth in a rice biparental mapping population, Bala x Azucena. We phenotyped &gt;1,400 3D root models and &gt;57,000 2D images for a suite of 25 traits that quantified the distribution, shape, extent of exploration, and the intrinsic size of root networks at days 12, 14, and 16 of growth in a gellan gum medium. From these data we identified 89 quantitative trait loci, some of which correspond to those found previously in soil-grown plants, and provide evidence for genetic tradeoffs in root growth allocations, such as between the extent and thoroughness of exploration. We also developed a multivariate method for generating and mapping central root architecture phenotypes and used it to identify five major quantitative trait loci (r2 = 24-37%), two of which were not identified by our univariate analysis. Our imaging and analytical platform provides a means to identify genes with high potential for improving root traits and agronomic qualities of crops."}],"doi":"10.1073/pnas.1304354110","day":"30","external_id":{"pmid":["25673779"]},"date_updated":"2021-01-12T06:59:58Z","citation":{"ista":"Topp C, Iyer Pascuzzi A, Anderson J, Lee C, Zurek P, Symonova O, Zheng Y, Bucksch A, Mileyko Y, Galkovskyi T, Moore B, Harer J, Edelsbrunner H, Mitchell Olds T, Weitz J, Benfey P. 2013. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. 110(18), E1695–E1704.","short":"C. Topp, A. Iyer Pascuzzi, J. Anderson, C. Lee, P. Zurek, O. Symonova, Y. Zheng, A. Bucksch, Y. Mileyko, T. Galkovskyi, B. Moore, J. Harer, H. Edelsbrunner, T. Mitchell Olds, J. Weitz, P. Benfey, PNAS 110 (2013) E1695–E1704.","mla":"Topp, Christopher, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” <i>PNAS</i>, vol. 110, no. 18, National Academy of Sciences, 2013, pp. E1695–704, doi:<a href=\"https://doi.org/10.1073/pnas.1304354110\">10.1073/pnas.1304354110</a>.","chicago":"Topp, Christopher, Anjali Iyer Pascuzzi, Jill Anderson, Cheng Lee, Paul Zurek, Olga Symonova, Ying Zheng, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1304354110\">https://doi.org/10.1073/pnas.1304354110</a>.","ieee":"C. Topp <i>et al.</i>, “3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture,” <i>PNAS</i>, vol. 110, no. 18. National Academy of Sciences, pp. E1695–E1704, 2013.","apa":"Topp, C., Iyer Pascuzzi, A., Anderson, J., Lee, C., Zurek, P., Symonova, O., … Benfey, P. (2013). 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1304354110\">https://doi.org/10.1073/pnas.1304354110</a>","ama":"Topp C, Iyer Pascuzzi A, Anderson J, et al. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. <i>PNAS</i>. 2013;110(18):E1695-E1704. doi:<a href=\"https://doi.org/10.1073/pnas.1304354110\">10.1073/pnas.1304354110</a>"},"year":"2013"},{"title":"Stable length estimates of tube-like shapes","alternative_title":["LNCS"],"month":"02","intvolume":"      7749","oa_version":"None","publication_status":"published","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:59:53Z","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","first_name":"Florian","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"}],"publication":"17th IAPR International Conference on Discrete Geometry for Computer Imagery","_id":"2843","scopus_import":1,"conference":{"start_date":"2013-03-20","name":"DGCI: Discrete Geometry for Computer Imagery","end_date":"2013-03-22","location":"Seville, Spain"},"publisher":"Springer","language":[{"iso":"eng"}],"page":"XV - XIX","quality_controlled":"1","abstract":[{"lang":"eng","text":"Mathematical objects can be measured unambiguously, but not so objects from our physical world. Even the total length of tubelike shapes has its difficulties. We introduce a combination of geometric, probabilistic, and topological methods to design a stable length estimate for tube-like shapes; that is: one that is insensitive to small shape changes."}],"publist_id":"3952","doi":"10.1007/978-3-642-37067-0","day":"21","date_published":"2013-02-21T00:00:00Z","type":"conference","date_updated":"2023-02-23T10:35:00Z","citation":{"apa":"Edelsbrunner, H., &#38; Pausinger, F. (2013). Stable length estimates of tube-like shapes. In <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i> (Vol. 7749, pp. XV–XIX). Seville, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-37067-0\">https://doi.org/10.1007/978-3-642-37067-0</a>","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. In: <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>. Vol 7749. Springer; 2013:XV-XIX. doi:<a href=\"https://doi.org/10.1007/978-3-642-37067-0\">10.1007/978-3-642-37067-0</a>","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” In <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, 7749:XV–XIX. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37067-0\">https://doi.org/10.1007/978-3-642-37067-0</a>.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” in <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, Seville, Spain, 2013, vol. 7749, pp. XV–XIX.","short":"H. Edelsbrunner, F. Pausinger, in:, 17th IAPR International Conference on Discrete Geometry for Computer Imagery, Springer, 2013, pp. XV–XIX.","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, vol. 7749, Springer, 2013, pp. XV–XIX, doi:<a href=\"https://doi.org/10.1007/978-3-642-37067-0\">10.1007/978-3-642-37067-0</a>.","ista":"Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX."},"year":"2013","related_material":{"record":[{"status":"public","id":"2255","relation":"later_version"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":7749},{"volume":15,"day":"01","arxiv":1,"doi":"10.4310/HHA.2013.v15.n1.a3","abstract":[{"lang":"eng","text":"Given a continuous function f:X-R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the extended persistence diagram of f. In addition, we quantify the robustness of the homology classes under perturbations of f using well groups, and we show how to read the ranks of these groups from the same extended persistence diagram. The special case X=R3 has ramifications in the fields of medical imaging and scientific visualization."}],"citation":{"ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.","mla":"Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, Homology, Homotopy and Applications 15 (2013) 51–72.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>. International Press, 2013. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>.","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1. International Press, pp. 51–72, 2013.","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2013). Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. International Press. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. 2013;15(1):51-72. doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>"},"year":"2013","date_updated":"2021-01-12T07:00:18Z","external_id":{"arxiv":["1102.3389"]},"publisher":"International Press","quality_controlled":"1","page":"51 - 72","date_created":"2018-12-11T11:59:58Z","department":[{"_id":"HeEd"}],"publication_status":"published","intvolume":"        15","title":"Homology and robustness of level and interlevel sets","scopus_import":1,"_id":"2859","issue":"1","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Bendich","full_name":"Bendich, Paul"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Morozov, Dmitriy","last_name":"Morozov","first_name":"Dmitriy"},{"last_name":"Patel","first_name":"Amit","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1102.3389v1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa":1,"publist_id":"3930","type":"journal_article","date_published":"2013-05-01T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Preprint","month":"05","publication":"Homology, Homotopy and Applications"},{"oa":1,"publist_id":"3872","type":"journal_article","date_published":"2013-02-12T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3574932/","open_access":"1"}],"month":"02","oa_version":"Published Version","publication":"PNAS","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Root system growth and development is highly plastic and is influenced by the surrounding environment. Roots frequently grow in heterogeneous environments that include interactions from neighboring plants and physical impediments in the rhizosphere. To investigate how planting density and physical objects affect root system growth, we grew rice in a transparent gel system in close proximity with another plant or a physical object. Root systems were imaged and reconstructed in three dimensions. Root-root interaction strength was calculated using quantitative metrics that characterize the extent towhich the reconstructed root systems overlap each other. Surprisingly, we found the overlap of root systems of the same genotype was significantly higher than that of root systems of different genotypes. Root systems of the same genotype tended to grow toward each other but those of different genotypes appeared to avoid each other. Shoot separation experiments excluded the possibility of aerial interactions, suggesting root communication. Staggered plantings indicated that interactions likely occur at root tips in close proximity. Recognition of obstacles also occurred through root tips, but through physical contact in a size-dependent manner. These results indicate that root systems use two different forms of communication to recognize objects and alter root architecture: root-root recognition, possibly mediated through root exudates, and root-object recognition mediated by physical contact at the root tips. This finding suggests that root tips act as local sensors that integrate rhizosphere information into global root architectural changes."}],"day":"12","doi":"10.1073/pnas.1222821110","external_id":{"pmid":["23362379"]},"year":"2013","citation":{"ieee":"S. Fang <i>et al.</i>, “Genotypic recognition and spatial responses by rice roots,” <i>PNAS</i>, vol. 110, no. 7. National Academy of Sciences, pp. 2670–2675, 2013.","chicago":"Fang, Suqin, Randy Clark, Ying Zheng, Anjali Iyer Pascuzzi, Joshua Weitz, Leon Kochian, Herbert Edelsbrunner, Hong Liao, and Philip Benfey. “Genotypic Recognition and Spatial Responses by Rice Roots.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1222821110\">https://doi.org/10.1073/pnas.1222821110</a>.","apa":"Fang, S., Clark, R., Zheng, Y., Iyer Pascuzzi, A., Weitz, J., Kochian, L., … Benfey, P. (2013). Genotypic recognition and spatial responses by rice roots. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1222821110\">https://doi.org/10.1073/pnas.1222821110</a>","ama":"Fang S, Clark R, Zheng Y, et al. Genotypic recognition and spatial responses by rice roots. <i>PNAS</i>. 2013;110(7):2670-2675. doi:<a href=\"https://doi.org/10.1073/pnas.1222821110\">10.1073/pnas.1222821110</a>","ista":"Fang S, Clark R, Zheng Y, Iyer Pascuzzi A, Weitz J, Kochian L, Edelsbrunner H, Liao H, Benfey P. 2013. Genotypic recognition and spatial responses by rice roots. PNAS. 110(7), 2670–2675.","mla":"Fang, Suqin, et al. “Genotypic Recognition and Spatial Responses by Rice Roots.” <i>PNAS</i>, vol. 110, no. 7, National Academy of Sciences, 2013, pp. 2670–75, doi:<a href=\"https://doi.org/10.1073/pnas.1222821110\">10.1073/pnas.1222821110</a>.","short":"S. Fang, R. Clark, Y. Zheng, A. Iyer Pascuzzi, J. Weitz, L. Kochian, H. Edelsbrunner, H. Liao, P. Benfey, PNAS 110 (2013) 2670–2675."},"date_updated":"2021-01-12T07:00:29Z","volume":110,"intvolume":"       110","title":"Genotypic recognition and spatial responses by rice roots","date_created":"2018-12-11T12:00:09Z","article_processing_charge":"No","department":[{"_id":"HeEd"}],"publication_status":"published","issue":"7","author":[{"full_name":"Fang, Suqin","last_name":"Fang","first_name":"Suqin"},{"full_name":"Clark, Randy","first_name":"Randy","last_name":"Clark"},{"last_name":"Zheng","first_name":"Ying","full_name":"Zheng, Ying"},{"full_name":"Iyer Pascuzzi, Anjali","first_name":"Anjali","last_name":"Iyer Pascuzzi"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"},{"full_name":"Kochian, Leon","first_name":"Leon","last_name":"Kochian"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Liao, Hong","first_name":"Hong","last_name":"Liao"},{"full_name":"Benfey, Philip","last_name":"Benfey","first_name":"Philip"}],"scopus_import":1,"pmid":1,"_id":"2887","article_type":"original","publisher":"National Academy of Sciences","quality_controlled":"1","page":"2670 - 2675"},{"publist_id":"3846","oa":1,"abstract":[{"text":" We introduce the M-modes problem for graphical models: predicting the M label configurations of highest probability that are at the same time local maxima of the probability landscape. M-modes have multiple possible applications: because they are intrinsically diverse, they provide a principled alternative to non-maximum suppression techniques for structured prediction, they can act as codebook vectors for quantizing the configuration space, or they can form component centers for mixture model approximation. We present two algorithms for solving the M-modes problem. The first algorithm solves the problem in polynomial time when the underlying graphical model is a simple chain. The second algorithm solves the problem for junction chains. In synthetic and real dataset, we demonstrate how M-modes can improve the performance of prediction. We also use the generated modes as a tool to understand the topography of the probability distribution of configurations, for example with relation to the training set size and amount of noise in the data. ","lang":"eng"}],"day":"01","type":"conference","date_published":"2013-01-01T00:00:00Z","citation":{"ama":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. Computing the M most probable modes of a graphical model. In: Vol 31. JMLR; 2013:161-169.","apa":"Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &#38; 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.","ieee":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.","chicago":"Chen, Chao, Vladimir Kolmogorov, Zhu Yan, Dimitris Metaxas, and Christoph Lampert. “Computing the M Most Probable Modes of a Graphical Model,” 31:161–69. JMLR, 2013.","short":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, JMLR, 2013, pp. 161–169.","mla":"Chen, Chao, et al. <i>Computing the M Most Probable Modes of a Graphical Model</i>. Vol. 31, JMLR, 2013, pp. 161–69.","ista":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model.  AISTATS: Conference on Uncertainty in Artificial Intelligence,  JMLR: W&#38;CP, vol. 31, 161–169."},"year":"2013","date_updated":"2021-01-12T07:00:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"http://jmlr.org/proceedings/papers/v31/chen13a.html","open_access":"1"}],"volume":31,"intvolume":"        31","title":"Computing the M most probable modes of a graphical model","month":"01","alternative_title":[" JMLR: W&CP"],"date_created":"2018-12-11T12:00:14Z","department":[{"_id":"HeEd"},{"_id":"VlKo"},{"_id":"ChLa"}],"publication_status":"published","oa_version":"None","author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","first_name":"Chao","last_name":"Chen"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yan, Zhu","first_name":"Zhu","last_name":"Yan"},{"full_name":"Metaxas, Dimitris","first_name":"Dimitris","last_name":"Metaxas"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"_id":"2901","conference":{"start_date":"2013-04-29","name":" AISTATS: Conference on Uncertainty in Artificial Intelligence","location":"Scottsdale, AZ, United States","end_date":"2013-05-01"},"publisher":"JMLR","language":[{"iso":"eng"}],"quality_controlled":"1","page":"161 - 169"}]