[{"abstract":[{"text":"We prove that the dual of the digital Voronoi diagram constructed by flooding the plane from the data points gives a geometrically and topologically correct dual triangulation. This provides the proof of correctness for recently developed GPU algorithms that outperform traditional CPU algorithms for constructing two-dimensional Delaunay triangulations.","lang":"eng"}],"oa_version":"None","acknowledgement":"The research of the second author is partially supported by NSF under grant DBI-0820624 and by DARPA under grants HR011-05-1-0057 and HR0011-09-006\r\n","scopus_import":1,"quality_controlled":"1","publisher":"Elsevier","month":"08","intvolume":" 48","publication_status":"published","year":"2015","day":"01","language":[{"iso":"eng"}],"publication":"Computational Geometry","page":"507 - 519","doi":"10.1016/j.comgeo.2015.04.001","issue":"7","date_published":"2015-08-01T00:00:00Z","volume":48,"date_created":"2018-12-11T11:52:49Z","_id":"1578","type":"journal_article","status":"public","date_updated":"2021-01-12T06:51:43Z","citation":{"apa":"Cao, T., Edelsbrunner, H., & Tan, T. (2015). Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. Elsevier. https://doi.org/10.1016/j.comgeo.2015.04.001","ama":"Cao T, Edelsbrunner H, Tan T. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 2015;48(7):507-519. doi:10.1016/j.comgeo.2015.04.001","ieee":"T. Cao, H. Edelsbrunner, and T. Tan, “Triangulations from topologically correct digital Voronoi diagrams,” Computational Geometry, vol. 48, no. 7. Elsevier, pp. 507–519, 2015.","short":"T. Cao, H. Edelsbrunner, T. Tan, Computational Geometry 48 (2015) 507–519.","mla":"Cao, Thanhtung, et al. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.","ista":"Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.","chicago":"Cao, Thanhtung, Herbert Edelsbrunner, and Tiowseng Tan. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2015.04.001."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5593","author":[{"full_name":"Cao, Thanhtung","last_name":"Cao","first_name":"Thanhtung"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Tiowseng","full_name":"Tan, Tiowseng","last_name":"Tan"}],"department":[{"_id":"HeEd"}],"title":"Triangulations from topologically correct digital Voronoi diagrams"},{"file_date_updated":"2020-07-14T12:45:03Z","department":[{"_id":"HeEd"}],"ddc":["000"],"date_updated":"2023-02-23T10:05:22Z","pubrep_id":"475","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"1584","license":"https://creativecommons.org/licenses/by/4.0/","issue":"5","related_material":{"record":[{"relation":"other","status":"public","id":"1582"}]},"volume":48,"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:17:36Z","file_name":"IST-2016-475-v1+1_1-s2.0-S092577211500005X-main.pdf","creator":"system","date_updated":"2020-07-14T12:45:03Z","file_size":508379,"file_id":"5292","checksum":"5b33719a86f7f4c8e5dc62c1b6893f49","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","intvolume":" 48","month":"07","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights."}],"title":"Reprint of: Weighted straight skeletons in the plane","publist_id":"5587","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan"},{"full_name":"Kaaser, Dominik","last_name":"Kaaser","first_name":"Dominik"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry: Theory and Applications 48 (2015) 429–442.","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Reprint of: Weighted straight skeletons in the plane,” Computational Geometry: Theory and Applications, vol. 48, no. 5. Elsevier, pp. 429–442, 2015.","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Reprint of: Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 2015;48(5):429-442. doi:10.1016/j.comgeo.2015.01.004","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). Reprint of: Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2015.01.004","mla":"Biedl, Therese, et al. “Reprint of: Weighted Straight Skeletons in the Plane.” Computational Geometry: Theory and Applications, vol. 48, no. 5, Elsevier, 2015, pp. 429–42, doi:10.1016/j.comgeo.2015.01.004.","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Reprint of: Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(5), 429–442.","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “Reprint of: Weighted Straight Skeletons in the Plane.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2015.01.004."},"date_created":"2018-12-11T11:52:51Z","date_published":"2015-07-01T00:00:00Z","doi":"10.1016/j.comgeo.2015.01.004","page":"429 - 442","publication":"Computational Geometry: Theory and Applications","day":"01","year":"2015","has_accepted_license":"1","oa":1,"publisher":"Elsevier","quality_controlled":"1"},{"title":"Weighted straight skeletons in the plane","publist_id":"5589","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kaaser","full_name":"Kaaser, Dominik","first_name":"Dominik"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry: Theory and Applications 48 (2015) 120–133.","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Weighted straight skeletons in the plane,” Computational Geometry: Theory and Applications, vol. 48, no. 2. Elsevier, pp. 120–133, 2015.","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.006","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 2015;48(2):120-133. doi:10.1016/j.comgeo.2014.08.006","mla":"Biedl, Therese, et al. “Weighted Straight Skeletons in the Plane.” Computational Geometry: Theory and Applications, vol. 48, no. 2, Elsevier, 2015, pp. 120–33, doi:10.1016/j.comgeo.2014.08.006.","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(2), 120–133.","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “Weighted Straight Skeletons in the Plane.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.006."},"date_published":"2015-02-01T00:00:00Z","doi":"10.1016/j.comgeo.2014.08.006","date_created":"2018-12-11T11:52:51Z","page":"120 - 133","day":"01","publication":"Computational Geometry: Theory and Applications","has_accepted_license":"1","year":"2015","quality_controlled":"1","publisher":"Elsevier","oa":1,"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:02Z","ddc":["000"],"date_updated":"2023-02-23T10:05:27Z","status":"public","pubrep_id":"474","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1582","volume":48,"issue":"2","related_material":{"record":[{"relation":"other","id":"1584","status":"public"}]},"file":[{"date_updated":"2020-07-14T12:45:02Z","file_size":505987,"creator":"system","date_created":"2018-12-12T10:16:28Z","file_name":"IST-2016-474-v1+1_1-s2.0-S0925772114000807-main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5215","checksum":"c1ef67f6ec925e12f73a96b8fe285ab4"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"02","intvolume":" 48","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights.","lang":"eng"}]},{"publist_id":"5588","author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dominik","full_name":"Kaaser, Dominik","last_name":"Kaaser"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","citation":{"chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.021.","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. 115(2), 243–247.","mla":"Biedl, Therese, et al. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” Information Processing Letters, vol. 115, no. 2, Elsevier, 2015, pp. 243–47, doi:10.1016/j.ipl.2014.09.021.","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. 2015;115(2):243-247. doi:10.1016/j.ipl.2014.09.021","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.021","short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Information Processing Letters 115 (2015) 243–247.","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “A simple algorithm for computing positively weighted straight skeletons of monotone polygons,” Information Processing Letters, vol. 115, no. 2. Elsevier, pp. 243–247, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"243 - 247","date_created":"2018-12-11T11:52:51Z","date_published":"2015-02-01T00:00:00Z","doi":"10.1016/j.ipl.2014.09.021","year":"2015","has_accepted_license":"1","publication":"Information Processing Letters","day":"01","oa":1,"publisher":"Elsevier","quality_controlled":"1","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:03Z","date_updated":"2021-01-12T06:51:45Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"473","status":"public","_id":"1583","volume":115,"issue":"2","publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:45:03Z","file_size":270137,"date_created":"2018-12-12T10:18:45Z","file_name":"IST-2016-473-v1+1_1-s2.0-S0020019014001987-main.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5367","checksum":"2779a648610c9b5c86d0b51a62816d23"}],"scopus_import":1,"intvolume":" 115","month":"02","abstract":[{"text":"We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlogn) time and O(n) space, where n denotes the number of vertices of the polygon.","lang":"eng"}],"oa_version":"Published Version"},{"_id":"1590","status":"public","type":"book_chapter","conference":{"name":"GD: International Symposium on Graph Drawing","start_date":"2015-09-24","location":"Los Angeles, CA, United States","end_date":"2015-09-26"},"date_updated":"2022-01-28T09:10:37Z","department":[{"_id":"HeEd"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed."}],"month":"11","intvolume":" 9411","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1508.01076","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-27260-3"],"eisbn":["978-3-319-27261-0"]},"publication_status":"published","volume":9411,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"short":"O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.","ieee":"O. Aichholzer et al., “Representing directed trees as straight skeletons,” in Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 335–347.","apa":"Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P., & Vogtenhuber, B. (2015). Representing directed trees as straight skeletons. In Graph Drawing and Network Visualization (Vol. 9411, pp. 335–347). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-319-27261-0_28","ama":"Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. Vol 9411. Springer Nature; 2015:335-347. doi:10.1007/978-3-319-27261-0_28","mla":"Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.” Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 335–47, doi:10.1007/978-3-319-27261-0_28.","ista":"Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 335–347.","chicago":"Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight Skeletons.” In Graph Drawing and Network Visualization, 9411:335–47. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-27261-0_28."},"title":"Representing directed trees as straight skeletons","author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"first_name":"Thomas","last_name":"Hackl","full_name":"Hackl, Thomas"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber"},{"first_name":"Peter","full_name":"Palfrader, Peter","last_name":"Palfrader"},{"first_name":"Birgit","last_name":"Vogtenhuber","full_name":"Vogtenhuber, Birgit"}],"publist_id":"5581","article_processing_charge":"No","publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"27","publication":"Graph Drawing and Network Visualization","year":"2015","date_published":"2015-11-27T00:00:00Z","doi":"10.1007/978-3-319-27261-0_28","date_created":"2018-12-11T11:52:54Z","page":"335 - 347"},{"oa_version":"Preprint","abstract":[{"text":"We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α > 0, it holds that each function g: K → ℝn such that ||g - f || ∞ < α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K > 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.","lang":"eng"}],"intvolume":" 62","month":"08","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1402.0858","open_access":"1"}],"quality_controlled":"1","publisher":"ACM","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Journal of the ACM","day":"01","publication_status":"published","year":"2015","date_created":"2018-12-11T11:53:27Z","volume":62,"doi":"10.1145/2751524","issue":"4","date_published":"2015-08-01T00:00:00Z","article_number":"26","_id":"1682","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2751524.","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. Journal of the ACM. 2015;62(4). doi:10.1145/2751524","apa":"Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM. https://doi.org/10.1145/2751524","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.","short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015).","mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM, vol. 62, no. 4, 26, ACM, 2015, doi:10.1145/2751524."},"date_updated":"2021-01-12T06:52:30Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"title":"Robust satisfiability of systems of equations","author":[{"first_name":"Peter","full_name":"Franek, Peter","last_name":"Franek"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Krcál, Marek","last_name":"Krcál"}],"publist_id":"5466"},{"oa_version":"Preprint","abstract":[{"text":"We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by a function u : (-1, 1) → ℝ, u(x) < 0, and a vertical flow of point particles incident on the hollow. It is assumed that u satisfies the so-called single impact condition (SIC): each incident particle is elastically reflected by graph(u) and goes away without hitting the graph of u anymore. We solve the problem: find the function u minimizing the force of resistance created by the flow. We show that the graph of the minimizer is formed by two arcs of parabolas symmetric to each other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals 1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014), pp. 2730-2742] stating in particular that the minimal resistance of a hollow in higher dimensions equals 0.5. We additionally consider a similar problem of minimal resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1 is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x = (x1,...,xd), u(ξ) < 0 for 0 ≤ ξ < 1, and u(ξ) = 0 for ξ ≥ 1, and the flow is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides with 0.6435 when d = 1) and converges to 0.5 as d → ∞.","lang":"eng"}],"month":"07","intvolume":" 47","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1410.3736","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":47,"issue":"4","ec_funded":1,"_id":"1710","status":"public","type":"journal_article","date_updated":"2021-01-12T06:52:41Z","department":[{"_id":"HeEd"}],"publisher":"SIAM","quality_controlled":"1","oa":1,"day":"14","publication":"Society for Industrial and Applied Mathematics","year":"2015","date_published":"2015-07-14T00:00:00Z","doi":"10.1137/140993843","date_created":"2018-12-11T11:53:36Z","page":"2754 - 2769","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” Society for Industrial and Applied Mathematics, vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:10.1137/140993843.","apa":"Akopyan, A., & Plakhov, A. (2015). Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. SIAM. https://doi.org/10.1137/140993843","ama":"Akopyan A, Plakhov A. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 2015;47(4):2754-2769. doi:10.1137/140993843","short":"A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47 (2015) 2754–2769.","ieee":"A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single impact assumption,” Society for Industrial and Applied Mathematics, vol. 47, no. 4. SIAM, pp. 2754–2769, 2015.","chicago":"Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under the Single Impact Assumption.” Society for Industrial and Applied Mathematics. SIAM, 2015. https://doi.org/10.1137/140993843.","ista":"Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769."},"title":"Minimal resistance of curves under the single impact assumption","publist_id":"5423","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"first_name":"Alexander","full_name":"Plakhov, Alexander","last_name":"Plakhov"}]},{"citation":{"mla":"Akopyan, Arseniy, et al. “Invariant Measures of Genetic Recombination Process.” Journal of Statistical Physics, vol. 160, no. 1, Springer, 2015, pp. 163–67, doi:10.1007/s10955-015-1238-5.","short":"A. Akopyan, S. Pirogov, A. Rybko, Journal of Statistical Physics 160 (2015) 163–167.","ieee":"A. Akopyan, S. Pirogov, and A. Rybko, “Invariant measures of genetic recombination process,” Journal of Statistical Physics, vol. 160, no. 1. Springer, pp. 163–167, 2015.","ama":"Akopyan A, Pirogov S, Rybko A. Invariant measures of genetic recombination process. Journal of Statistical Physics. 2015;160(1):163-167. doi:10.1007/s10955-015-1238-5","apa":"Akopyan, A., Pirogov, S., & Rybko, A. (2015). Invariant measures of genetic recombination process. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-015-1238-5","chicago":"Akopyan, Arseniy, Sergey Pirogov, and Aleksandr Rybko. “Invariant Measures of Genetic Recombination Process.” Journal of Statistical Physics. Springer, 2015. https://doi.org/10.1007/s10955-015-1238-5.","ista":"Akopyan A, Pirogov S, Rybko A. 2015. Invariant measures of genetic recombination process. Journal of Statistical Physics. 160(1), 163–167."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5276","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"last_name":"Pirogov","full_name":"Pirogov, Sergey","first_name":"Sergey"},{"first_name":"Aleksandr","full_name":"Rybko, Aleksandr","last_name":"Rybko"}],"article_processing_charge":"No","title":"Invariant measures of genetic recombination process","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"year":"2015","day":"01","publication":"Journal of Statistical Physics","page":"163 - 167","doi":"10.1007/s10955-015-1238-5","date_published":"2015-07-01T00:00:00Z","date_created":"2018-12-11T11:54:14Z","quality_controlled":"1","publisher":"Springer","oa":1,"date_updated":"2021-01-12T06:53:28Z","department":[{"_id":"HeEd"}],"_id":"1828","type":"journal_article","status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":160,"issue":"1","ec_funded":1,"abstract":[{"lang":"eng","text":"We construct a non-linear Markov process connected with a biological model of a bacterial genome recombination. The description of invariant measures of this process gives us the solution of one problem in elementary probability theory."}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"url":"arxiv.org/abs/1406.5313","open_access":"1"}],"month":"07","intvolume":" 160"},{"month":"03","intvolume":" 379","scopus_import":1,"publisher":"Elsevier","quality_controlled":"1","oa_version":"None","acknowledgement":"F.P. was supported by the Graduate School of IST Austria. S.S. was partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and Michael Kerber for sharing their implementation of the persistence algorithm. ","abstract":[{"text":"We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2.","lang":"eng"}],"date_published":"2015-03-06T00:00:00Z","issue":"6","doi":"10.1016/j.physleta.2014.12.010","volume":379,"date_created":"2018-12-11T11:54:49Z","page":"535 - 541","day":"06","language":[{"iso":"eng"}],"publication":"Physics Letters, Section A","year":"2015","publication_status":"published","status":"public","type":"journal_article","_id":"1938","department":[{"_id":"HeEd"}],"title":"On the distribution of local extrema in quantum chaos","author":[{"last_name":"Pausinger","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"},{"first_name":"Stefan","full_name":"Steinerberger, Stefan","last_name":"Steinerberger"}],"publist_id":"5152","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"F. Pausinger and S. Steinerberger, “On the distribution of local extrema in quantum chaos,” Physics Letters, Section A, vol. 379, no. 6. Elsevier, pp. 535–541, 2015.","short":"F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.","ama":"Pausinger F, Steinerberger S. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 2015;379(6):535-541. doi:10.1016/j.physleta.2014.12.010","apa":"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","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A, vol. 379, no. 6, Elsevier, 2015, pp. 535–41, doi:10.1016/j.physleta.2014.12.010.","ista":"Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A. Elsevier, 2015. https://doi.org/10.1016/j.physleta.2014.12.010."},"date_updated":"2021-01-12T06:54:12Z"},{"pubrep_id":"486","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"2035","file_date_updated":"2020-07-14T12:45:26Z","department":[{"_id":"HeEd"}],"ddc":["000"],"date_updated":"2021-01-12T06:54:53Z","intvolume":" 15","month":"10","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.\r\n","lang":"eng"}],"ec_funded":1,"volume":15,"issue":"5","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"3566f3a8b0c1bc550e62914a88c584ff","file_id":"4670","creator":"system","date_updated":"2020-07-14T12:45:26Z","file_size":1317546,"date_created":"2018-12-12T10:08:10Z","file_name":"IST-2016-486-v1+1_s10208-014-9223-y.pdf"}],"publication_status":"published","project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"The persistent homology of a self-map","publist_id":"5022","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","last_name":"Jablonski","full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866"},{"full_name":"Mrozek, Marian","last_name":"Mrozek","first_name":"Marian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi:10.1007/s10208-014-9223-y.","ieee":"H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” Foundations of Computational Mathematics, vol. 15, no. 5. Springer, pp. 1213–1244, 2015.","short":"H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.","ama":"Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map. Foundations of Computational Mathematics. 2015;15(5):1213-1244. doi:10.1007/s10208-014-9223-y","apa":"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","chicago":"Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics. Springer, 2015. https://doi.org/10.1007/s10208-014-9223-y.","ista":"Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244."},"oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the Polish National Science Center under Grant No. N201 419639.","date_created":"2018-12-11T11:55:20Z","doi":"10.1007/s10208-014-9223-y","date_published":"2015-10-01T00:00:00Z","page":"1213 - 1244","publication":"Foundations of Computational Mathematics","day":"01","year":"2015","has_accepted_license":"1"},{"type":"journal_article","status":"public","_id":"1805","department":[{"_id":"HeEd"}],"date_updated":"2023-02-23T10:59:19Z","scopus_import":1,"month":"06","intvolume":" 48","abstract":[{"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 double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck 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.","lang":"eng"}],"oa_version":"None","volume":48,"issue":"8","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2812"}]},"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493"}],"publist_id":"5305","author":[{"last_name":"Attali","full_name":"Attali, Dominique","first_name":"Dominique"},{"last_name":"Bauer","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich"},{"last_name":"Devillers","full_name":"Devillers, Olivier","first_name":"Olivier"},{"first_name":"Marc","full_name":"Glisse, Marc","last_name":"Glisse"},{"last_name":"Lieutier","full_name":"Lieutier, André","first_name":"André"}],"title":"Homological reconstruction and simplification in R3","citation":{"ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” Computational Geometry: Theory and Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621.","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015). Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Elsevier","page":"606 - 621","doi":"10.1016/j.comgeo.2014.08.010","date_published":"2015-06-03T00:00:00Z","date_created":"2018-12-11T11:54:06Z","year":"2015","day":"03","publication":"Computational Geometry: Theory and Applications"},{"oa":1,"quality_controlled":"1","publisher":"Public Library of Science","year":"2015","has_accepted_license":"1","publication":"PLoS One","day":"01","date_created":"2018-12-11T11:54:02Z","date_published":"2015-06-01T00:00:00Z","doi":"10.1371/journal.pone.0127657","article_number":"e0127657","citation":{"ista":"Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.","chicago":"Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One. Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0127657.","apa":"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","ama":"Symonova O, Topp C, Edelsbrunner H. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 2015;10(6). doi:10.1371/journal.pone.0127657","ieee":"O. Symonova, C. Topp, and H. Edelsbrunner, “DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots,” PLoS One, vol. 10, no. 6. Public Library of Science, 2015.","short":"O. Symonova, C. Topp, H. Edelsbrunner, PLoS One 10 (2015).","mla":"Symonova, Olga, et al. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One, vol. 10, no. 6, e0127657, Public Library of Science, 2015, doi:10.1371/journal.pone.0127657."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Symonova, Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga"},{"first_name":"Christopher","full_name":"Topp, Christopher","last_name":"Topp"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5318","title":"DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots","abstract":[{"lang":"eng","text":"We present a software platform for reconstructing and analyzing the growth of a plant root system from a time-series of 3D voxelized shapes. It aligns the shapes with each other, constructs a geometric graph representation together with the function that records the time of growth, and organizes the branches into a hierarchy that reflects the order of creation. The software includes the automatic computation of structural and dynamic traits for each root in the system enabling the quantification of growth on fine-scale. These are important advances in plant phenotyping with applications to the study of genetic and environmental influences on growth."}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 10","month":"06","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-454-v1+1_journal.pone.0127657.pdf","date_created":"2018-12-12T10:15:30Z","creator":"system","file_size":1850825,"date_updated":"2020-07-14T12:45:16Z","file_id":"5150","checksum":"d20f26461ca575276ad3ed9ce4bfc787","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"related_material":{"record":[{"status":"public","id":"9737","relation":"research_data"}]},"volume":10,"issue":"6","_id":"1793","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","pubrep_id":"454","status":"public","date_updated":"2023-02-23T14:06:33Z","ddc":["000"],"department":[{"_id":"MaJö"},{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:16Z"},{"_id":"9737","type":"research_data_reference","status":"public","citation":{"ama":"Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001","apa":"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","short":"O. Symonova, C. Topp, H. Edelsbrunner, (2015).","ieee":"O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots for the maize root shown in fig 2.” Public Library of Science, 2015.","mla":"Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.","ista":"Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.","chicago":"Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001."},"date_updated":"2023-02-23T10:14:42Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","author":[{"last_name":"Symonova","full_name":"Symonova, Olga","first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Topp","full_name":"Topp, Christopher","first_name":"Christopher"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"department":[{"_id":"MaJö"},{"_id":"HeEd"}],"title":"Root traits computed by DynamicRoots for the maize root shown in fig 2","oa_version":"Published Version","publisher":"Public Library of Science","month":"06","year":"2015","day":"01","date_created":"2021-07-28T06:20:13Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1793"}]},"doi":"10.1371/journal.pone.0127657.s001","date_published":"2015-06-01T00:00:00Z"},{"publication":"Journal of Complexity","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2015","date_created":"2018-12-11T11:54:02Z","volume":31,"related_material":{"record":[{"status":"public","id":"1399","relation":"dissertation_contains"}]},"doi":"10.1016/j.jco.2015.06.002","issue":"6","date_published":"2015-12-01T00:00:00Z","page":"773 - 797","acknowledgement":"F.P. is supported by the Graduate School of IST Austria, A.M.S is supported by the Centre for Stochastic Geometry and Advanced Bioimaging funded by a grant from the Villum Foundation.","oa_version":"None","abstract":[{"text":"Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop a new concept of variation of multivariate functions on a compact Hausdorff space with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka theorem that holds for this notion of variation and discrepancy with respect to D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions, such as extreme or isotropic discrepancy. For extreme discrepancy, our result coincides with the usual Koksma-Hlawka theorem. We show that the space of functions of bounded D-variation contains important discontinuous functions and is closed under natural algebraic operations. Finally, we illustrate the results on concrete integration problems from integral geometry and stereology.","lang":"eng"}],"intvolume":" 31","month":"12","publisher":"Academic Press","quality_controlled":"1","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:41:25Z","citation":{"chicago":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” Journal of Complexity. Academic Press, 2015. https://doi.org/10.1016/j.jco.2015.06.002.","ista":"Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 31(6), 773–797.","mla":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” Journal of Complexity, vol. 31, no. 6, Academic Press, 2015, pp. 773–97, doi:10.1016/j.jco.2015.06.002.","ieee":"F. Pausinger and A. Svane, “A Koksma-Hlawka inequality for general discrepancy systems,” Journal of Complexity, vol. 31, no. 6. Academic Press, pp. 773–797, 2015.","short":"F. Pausinger, A. Svane, Journal of Complexity 31 (2015) 773–797.","ama":"Pausinger F, Svane A. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 2015;31(6):773-797. doi:10.1016/j.jco.2015.06.002","apa":"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"},"title":"A Koksma-Hlawka inequality for general discrepancy systems","department":[{"_id":"HeEd"}],"publist_id":"5320","author":[{"last_name":"Pausinger","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Svane, Anne","last_name":"Svane","first_name":"Anne"}],"_id":"1792","status":"public","type":"journal_article"},{"_id":"1399","type":"dissertation","status":"public","supervisor":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"citation":{"chicago":"Pausinger, Florian. “On the Approximation of Intrinsic Volumes.” Institute of Science and Technology Austria, 2015.","ista":"Pausinger F. 2015. On the approximation of intrinsic volumes. Institute of Science and Technology Austria.","mla":"Pausinger, Florian. On the Approximation of Intrinsic Volumes. Institute of Science and Technology Austria, 2015.","ama":"Pausinger F. On the approximation of intrinsic volumes. 2015.","apa":"Pausinger, F. (2015). On the approximation of intrinsic volumes. Institute of Science and Technology Austria.","ieee":"F. Pausinger, “On the approximation of intrinsic volumes,” Institute of Science and Technology Austria, 2015.","short":"F. Pausinger, On the Approximation of Intrinsic Volumes, Institute of Science and Technology Austria, 2015."},"date_updated":"2023-09-07T11:41:25Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pausinger","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian"}],"publist_id":"5808","article_processing_charge":"No","title":"On the approximation of intrinsic volumes","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"This thesis is concerned with the computation and approximation of intrinsic volumes. Given a smooth body M and a certain digital approximation of it, we develop algorithms to approximate various intrinsic volumes of M using only measurements taken from its digital approximations. The crucial idea behind our novel algorithms is to link the recent theory of persistent homology to the theory of intrinsic volumes via the Crofton formula from integral geometry and, in particular, via Euler characteristic computations. Our main contributions are a multigrid convergent digital algorithm to compute the first intrinsic volume of a solid body in R^n as well as an appropriate integration pipeline to approximate integral-geometric integrals defined over the Grassmannian manifold."}],"oa_version":"None","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"month":"06","publication_identifier":{"issn":["2663-337X"]},"year":"2015","publication_status":"published","degree_awarded":"PhD","day":"01","language":[{"iso":"eng"}],"page":"144","date_published":"2015-06-01T00:00:00Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1662"},{"relation":"part_of_dissertation","id":"1792","status":"public"},{"relation":"part_of_dissertation","id":"2255","status":"public"}]},"date_created":"2018-12-11T11:51:48Z"},{"article_processing_charge":"No","author":[{"first_name":"Jens","last_name":"Kasten","full_name":"Kasten, Jens"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"Reich, Wieland","last_name":"Reich","first_name":"Wieland"},{"first_name":"Gerik","last_name":"Scheuermann","full_name":"Scheuermann, Gerik"}],"editor":[{"full_name":"Bremer, Peer-Timo","last_name":"Bremer","first_name":"Peer-Timo"},{"full_name":"Hotz, Ingrid","last_name":"Hotz","first_name":"Ingrid"},{"last_name":"Pascucci","full_name":"Pascucci, Valerio","first_name":"Valerio"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}],"title":"Toward the extraction of saddle periodic orbits","citation":{"short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","apa":"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","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4.","ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_4."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493"}],"page":"55-69","date_created":"2022-03-21T07:11:23Z","doi":"10.1007/978-3-319-04099-8_4","date_published":"2014-03-19T00:00:00Z","year":"2014","publication":"Topological Methods in Data Analysis and Visualization III ","day":"19","publisher":"Springer","quality_controlled":"1","acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","department":[{"_id":"HeEd"}],"date_updated":"2022-06-21T12:01:47Z","type":"book_chapter","status":"public","_id":"10893","series_title":"Mathematics and Visualization","ec_funded":1,"volume":1,"publication_status":"published","publication_identifier":{"eisbn":["9783319040998"],"issn":["1612-3786"],"isbn":["9783319040981"],"eissn":["2197-666X"]},"language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 1","month":"03","place":"Cham","abstract":[{"lang":"eng","text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data."}],"oa_version":"None"},{"date_created":"2018-12-11T11:54:10Z","doi":"10.1142/S0218195914500034","date_published":"2014-03-16T00:00:00Z","page":"61 - 86","publication":"International Journal of Computational Geometry and Applications","day":"16","year":"2014","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"World Scientific Publishing","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","title":"Topology-preserving watermarking of vector graphics","author":[{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"first_name":"Peter","last_name":"Meerwald","full_name":"Meerwald, Peter"},{"last_name":"Kwitt","full_name":"Kwitt, Roland","first_name":"Roland"}],"publist_id":"5290","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2014. https://doi.org/10.1142/S0218195914500034.","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” International Journal of Computational Geometry and Applications, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 2014;24(1):61-86. doi:10.1142/S0218195914500034","apa":"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","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:10.1142/S0218195914500034."},"volume":24,"issue":"1","language":[{"iso":"eng"}],"file":[{"file_id":"4704","checksum":"be45c133ab4d43351260e21beaa8f4b1","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:08:43Z","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","creator":"system","date_updated":"2020-07-14T12:45:17Z","file_size":991734}],"publication_status":"published","intvolume":" 24","month":"03","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:17Z","department":[{"_id":"HeEd"}],"ddc":["000"],"date_updated":"2021-01-12T06:53:23Z","pubrep_id":"443","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"1816"},{"intvolume":" 53","month":"11","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1310.7004","open_access":"1"}],"scopus_import":1,"publisher":"Springer","acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices."}],"date_created":"2018-12-11T11:54:18Z","volume":53,"date_published":"2014-11-14T00:00:00Z","issue":"1","doi":"10.1007/s00454-014-9646-x","page":"64 - 79","publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}],"day":"14","publication_status":"published","year":"2014","status":"public","type":"journal_article","_id":"1842","title":"On the geometric ramsey number of outerplanar graphs","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publist_id":"5260","author":[{"first_name":"Josef","full_name":"Cibulka, Josef","last_name":"Cibulka"},{"last_name":"Gao","full_name":"Gao, Pu","first_name":"Pu"},{"full_name":"Krcál, Marek","last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Valla, Tomáš","last_name":"Valla","first_name":"Tomáš"},{"first_name":"Pavel","last_name":"Valtr","full_name":"Valtr, Pavel"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:53:33Z","citation":{"ieee":"J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete & Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete & Computational Geometry 53 (2014) 64–79.","ama":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 2014;53(1):64-79. doi:10.1007/s00454-014-9646-x","apa":"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","mla":"Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:10.1007/s00454-014-9646-x.","ista":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 53(1), 64–79.","chicago":"Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9646-x."}},{"citation":{"mla":"Dolbilin, Nikolai, et al. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal, vol. 14, no. 3, Independent University of Moscow, 2014, pp. 491–504, doi:10.17323/1609-4514-2014-14-3-491-504.","ieee":"N. Dolbilin, H. Edelsbrunner, A. Glazyrin, and O. Musin, “Functionals on triangulations of delaunay sets,” Moscow Mathematical Journal, vol. 14, no. 3. Independent University of Moscow, pp. 491–504, 2014.","short":"N. Dolbilin, H. Edelsbrunner, A. Glazyrin, O. Musin, Moscow Mathematical Journal 14 (2014) 491–504.","apa":"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","ama":"Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 2014;14(3):491-504. doi:10.17323/1609-4514-2014-14-3-491-504","chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, Alexey Glazyrin, and Oleg Musin. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal. Independent University of Moscow, 2014. https://doi.org/10.17323/1609-4514-2014-14-3-491-504.","ista":"Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. 2014. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 14(3), 491–504."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1211.7053"]},"publist_id":"5220","author":[{"last_name":"Dolbilin","full_name":"Dolbilin, Nikolai","first_name":"Nikolai"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Alexey","last_name":"Glazyrin","full_name":"Glazyrin, Alexey"},{"first_name":"Oleg","last_name":"Musin","full_name":"Musin, Oleg"}],"title":"Functionals on triangulations of delaunay sets","year":"2014","publication":"Moscow Mathematical Journal","day":"01","page":"491 - 504","date_created":"2018-12-11T11:54:29Z","doi":"10.17323/1609-4514-2014-14-3-491-504","date_published":"2014-07-01T00:00:00Z","oa":1,"publisher":"Independent University of Moscow","quality_controlled":"1","date_updated":"2022-03-03T11:47:09Z","department":[{"_id":"HeEd"}],"_id":"1876","type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"issn":["16093321"]},"language":[{"iso":"eng"}],"volume":14,"issue":"3","abstract":[{"lang":"eng","text":"We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.7053"}],"scopus_import":"1","intvolume":" 14","month":"07"},{"citation":{"ama":"Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. 2014;203(6):754-760. doi:10.1007/s10958-014-2165-8","apa":"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","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,” Journal of Mathematical Sciences, vol. 203, no. 6. Springer, pp. 754–760, 2014.","mla":"Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” Journal of Mathematical Sciences, vol. 203, no. 6, Springer, 2014, pp. 754–60, doi:10.1007/s10958-014-2165-8.","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.","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.” Journal of Mathematical Sciences. Springer, 2014. https://doi.org/10.1007/s10958-014-2165-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publist_id":"5165","author":[{"first_name":"V V","full_name":"Alexeev, V V","last_name":"Alexeev"},{"last_name":"Bogaevskaya","full_name":"Bogaevskaya, V G","first_name":"V G"},{"first_name":"M M","last_name":"Preobrazhenskaya","full_name":"Preobrazhenskaya, M M"},{"first_name":"A Y","last_name":"Ukhalov","full_name":"Ukhalov, A Y"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olga","last_name":"Yakimova","full_name":"Yakimova, Olga"}],"title":"An algorithm for cartographic generalization that preserves global topology","year":"2014","publication":"Journal of Mathematical Sciences","day":"16","page":"754 - 760","date_created":"2018-12-11T11:54:46Z","date_published":"2014-11-16T00:00:00Z","doi":"10.1007/s10958-014-2165-8","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.","publisher":"Springer","quality_controlled":"1","date_updated":"2022-05-24T10:39:06Z","department":[{"_id":"HeEd"}],"_id":"1929","type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"eissn":["1573-8795"],"issn":["1072-3374"]},"language":[{"iso":"eng"}],"issue":"6","volume":203,"abstract":[{"text":"We propose an algorithm for the generalization of cartographic objects that can be used to represent maps on different scales.","lang":"eng"}],"oa_version":"None","scopus_import":"1","intvolume":" 203","month":"11"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:09Z","citation":{"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.” IEEE Transactions on Visualization and Computer Graphics. IEEE, 2014. https://doi.org/10.1109/TVCG.2014.2346432.","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.","mla":"Günther, David, et al. “Fast and Memory-Efficient Topological Denoising of 2D and 3D Scalar Fields.” IEEE Transactions on Visualization and Computer Graphics, vol. 20, no. 12, IEEE, 2014, pp. 2585–94, doi:10.1109/TVCG.2014.2346432.","apa":"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","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. IEEE Transactions on Visualization and Computer Graphics. 2014;20(12):2585-2594. doi:10.1109/TVCG.2014.2346432","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.","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,” IEEE Transactions on Visualization and Computer Graphics, vol. 20, no. 12. IEEE, pp. 2585–2594, 2014."},"title":"Fast and memory-efficient topological denoising of 2D and 3D scalar fields","department":[{"_id":"HeEd"}],"publist_id":"5164","author":[{"full_name":"Günther, David","last_name":"Günther","first_name":"David"},{"first_name":"Alec","full_name":"Jacobson, Alec","last_name":"Jacobson"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"first_name":"Hans","full_name":"Seidel, Hans","last_name":"Seidel"},{"full_name":"Sorkine Hornung, Olga","last_name":"Sorkine Hornung","first_name":"Olga"},{"first_name":"Tino","full_name":"Weinkauf, Tino","last_name":"Weinkauf"}],"_id":"1930","status":"public","type":"journal_article","publication":"IEEE Transactions on Visualization and Computer Graphics","language":[{"iso":"eng"}],"day":"31","year":"2014","publication_status":"published","date_created":"2018-12-11T11:54:46Z","doi":"10.1109/TVCG.2014.2346432","volume":20,"date_published":"2014-12-31T00:00:00Z","issue":"12","page":"2585 - 2594","acknowledgement":"RTRA Digiteoproject; ERC grant; SNF award; Intel Doctoral Fellowship; MPC-VCC","oa_version":"None","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."}],"intvolume":" 20","month":"12","publisher":"IEEE","quality_controlled":"1","scopus_import":1},{"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.0710"}],"scopus_import":1,"month":"01","date_updated":"2021-01-12T06:54:56Z","department":[{"_id":"HeEd"}],"_id":"2043","conference":{"name":"ALENEX: Algorithm Engineering and Experiments","start_date":"2014-01-05","end_date":"2014-01-05","location":"Portland, USA"},"type":"conference","status":"public","year":"2014","publication":"Proceedings of the Workshop on Algorithm Engineering and Experiments","day":"01","page":"31 - 38","date_created":"2018-12-11T11:55:23Z","doi":"10.1137/1.9781611973198.4","date_published":"2014-01-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Society of Industrial and Applied Mathematics","citation":{"apa":"Bauer, U., Kerber, M., & Reininghaus, J. (2014). Distributed computation of persistent homology. In C. 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","ama":"Bauer U, Kerber M, Reininghaus J. Distributed computation of persistent homology. In: McGeoch C, Meyer U, eds. Proceedings of the Workshop on Algorithm Engineering and Experiments. Society of Industrial and Applied Mathematics; 2014:31-38. doi:10.1137/1.9781611973198.4","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent homology,” in Proceedings of the Workshop on Algorithm Engineering and Experiments, Portland, USA, 2014, pp. 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.” Proceedings of the Workshop on Algorithm Engineering and Experiments, edited by Catherine McGeoch and Ulrich Meyer, Society of Industrial and Applied Mathematics, 2014, pp. 31–38, doi:10.1137/1.9781611973198.4.","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.","chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Distributed Computation of Persistent Homology.” In Proceedings of the Workshop on Algorithm Engineering and Experiments, edited by Catherine McGeoch and Ulrich Meyer, 31–38. Society of Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973198.4."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer"},{"first_name":"Michael","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5008","editor":[{"first_name":"Catherine","full_name":" McGeoch, Catherine","last_name":" McGeoch"},{"first_name":"Ulrich","last_name":"Meyer","full_name":"Meyer, Ulrich"}],"title":"Distributed computation of persistent homology","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}]},{"year":"2014","day":"19","publication":"Topological Methods in Data Analysis and Visualization III","page":"103 - 117","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_7","date_created":"2018-12-11T11:55:23Z","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"chicago":"Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Clear and Compress: Computing Persistent Homology in Chunks.” In Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 103–17. Mathematics and Visualization. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_7.","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.” Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:10.1007/978-3-319-04099-8_7.","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.","ieee":"U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in Topological Methods in Data Analysis and Visualization III, 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. Topological Methods in Data Analysis and Visualization III. Mathematics and Visualization. Springer; 2014:103-117. doi:10.1007/978-3-319-04099-8_7","apa":"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"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5007","author":[{"orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael"},{"last_name":"Reininghaus","full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87"}],"title":"Clear and Compress: Computing Persistent Homology in Chunks","editor":[{"last_name":"Bremer","full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}],"project":[{"call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems"}],"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1303.0477","open_access":"1"}],"month":"03","date_updated":"2021-01-12T06:54:56Z","department":[{"_id":"HeEd"}],"_id":"2044","series_title":"Mathematics and Visualization","type":"book_chapter","status":"public"},{"_id":"2153","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493"}],"status":"public","conference":{"start_date":"2014-06-08","end_date":"2014-06-11","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 355–364.","apa":"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","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:355-364. doi:10.1145/2582112.2582168","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.","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."},"date_updated":"2021-01-12T06:55:38Z","title":"Induced matchings of barcodes and the algebraic stability of persistence","department":[{"_id":"HeEd"}],"author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","last_name":"Bauer","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"first_name":"Michael","full_name":"Lesnick, Michael","last_name":"Lesnick"}],"publist_id":"4853","oa_version":"Submitted Version","abstract":[{"lang":"eng","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)."}],"month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}],"oa":1,"quality_controlled":"1","scopus_import":1,"publisher":"ACM","publication":"Proceedings of the Annual Symposium on Computational Geometry","language":[{"iso":"eng"}],"day":"01","year":"2014","publication_status":"published","date_created":"2018-12-11T11:56:01Z","ec_funded":1,"date_published":"2014-06-01T00:00:00Z","doi":"10.1145/2582112.2582168","page":"355 - 364"},{"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"scopus_import":1,"month":"06","abstract":[{"lang":"eng","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)."}],"oa_version":"Submitted Version","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:55:39Z","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"type":"conference","status":"public","_id":"2156","page":"464 - 473","date_created":"2018-12-11T11:56:02Z","doi":"10.1145/2582112.2582169","date_published":"2014-06-01T00:00:00Z","year":"2014","publication":"Proceedings of the Annual Symposium on Computational Geometry","day":"01","oa":1,"publisher":"ACM","quality_controlled":"1","acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","publist_id":"4850","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer"},{"first_name":"Xiaoyin","last_name":"Ge","full_name":"Ge, Xiaoyin"},{"first_name":"Yusu","last_name":"Wang","full_name":"Wang, Yusu"}],"title":"Measuring distance between Reeb graphs","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.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In Proceedings of the Annual Symposium on Computational Geometry, 464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 464–473.","apa":"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","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}]},{"oa_version":"Submitted Version","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"}],"month":"06","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"_id":"2155","status":"public","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","end_date":"2014-06-11","location":"Kyoto, Japan"},"date_updated":"2021-01-12T06:55:38Z","department":[{"_id":"HeEd"}],"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","publisher":"ACM","quality_controlled":"1","oa":1,"day":"01","publication":"Proceedings of the Annual Symposium on Computational Geometry","year":"2014","date_published":"2014-06-01T00:00:00Z","doi":"10.1145/2582112.2582167","date_created":"2018-12-11T11:56:01Z","page":"484 - 490","project":[{"grant_number":"318493","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.","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.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.","apa":"Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech 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","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: Proceedings of the Annual Symposium on Computational Geometry. ACM; 2014:484-490. doi:10.1145/2582112.2582167","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490."},"title":"The morse theory of Čech and Delaunay filtrations","publist_id":"4851","author":[{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}]},{"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2014-01-05","location":"Portland, USA","end_date":"2014-01-07"},"type":"conference","status":"public","_id":"2177","publist_id":"4805","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Parsa","full_name":"Parsa, Salman","id":"4BDBD4F2-F248-11E8-B48F-1D18A9856A87","first_name":"Salman"}],"title":"On the computational complexity of betti numbers reductions from matrix rank","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:55:48Z","citation":{"chicago":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.","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.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.","short":"H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.","ieee":"H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.","ama":"Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11","apa":"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"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"SIAM","scopus_import":1,"month":"01","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"}],"oa_version":"None","page":"152 - 160","date_created":"2018-12-11T11:56:09Z","date_published":"2014-01-01T00:00:00Z","doi":"10.1137/1.9781611973402.11","year":"2014","publication_status":"published","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01"},{"quality_controlled":"1","publisher":"ACM","oa":1,"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).","date_published":"2014-05-01T00:00:00Z","doi":"10.1145/2597629","date_created":"2018-12-11T11:56:12Z","day":"01","publication":"Journal of the ACM","year":"2014","article_number":"17 ","title":"Computing all maps into a sphere","publist_id":"4797","author":[{"full_name":"Čadek, Martin","last_name":"Čadek","first_name":"Martin"},{"last_name":"Krcál","full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek"},{"first_name":"Jiří","full_name":"Matoušek, Jiří","last_name":"Matoušek"},{"first_name":"Francis","full_name":"Sergeraert, Francis","last_name":"Sergeraert"},{"last_name":"Vokřínek","full_name":"Vokřínek, Lukáš","first_name":"Lukáš"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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.","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597629.","apa":"Č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. ACM. https://doi.org/10.1145/2597629","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. Journal of the ACM. 2014;61(3). doi:10.1145/2597629","ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” Journal of the ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629."},"month":"05","intvolume":" 61","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1105.6257"}],"oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"volume":61,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"2184","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2021-01-12T06:55:50Z"},{"oa":1,"publisher":"European Mathematical Society Publishing House","quality_controlled":"1","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","page":"31 - 50","date_created":"2018-12-11T12:00:16Z","doi":"10.4171/120-1/3","date_published":"2014-01-01T00:00:00Z","year":"2014","has_accepted_license":"1","day":"01","article_processing_charge":"No","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Morozovy","full_name":"Morozovy, Dmitriy","first_name":"Dmitriy"}],"publist_id":"3842","title":"Persistent homology: Theory and practice","citation":{"ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3","apa":"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","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","abstract":[{"text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions.","lang":"eng"}],"oa_version":"Submitted Version","publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5232","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","creator":"system","date_updated":"2020-07-14T12:45:52Z","file_size":435320,"date_created":"2018-12-12T10:16:43Z","file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf"}],"conference":{"name":"ECM: European Congress of Mathematics","location":"Kraków, Poland","end_date":"2012-07-07","start_date":"2012-07-02"},"type":"conference","pubrep_id":"544","status":"public","_id":"2905","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:52Z","date_updated":"2021-01-12T07:00:36Z","ddc":["000"]},{"_id":"10892","conference":{"start_date":"2014-12-15","location":"Jeonju, Korea","end_date":"2014-12-17","name":"ISAAC: International Symposium on Algorithms and Computation"},"type":"conference","status":"public","date_updated":"2023-02-23T12:20:55Z","department":[{"_id":"HeEd"}],"abstract":[{"text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"oa_version":"None","scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 8889","month":"11","publication_status":"published","publication_identifier":{"eisbn":["9783319130750"],"issn":["0302-9743"],"isbn":["9783319130743"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"volume":8889,"related_material":{"record":[{"relation":"later_version","status":"public","id":"481"}]},"citation":{"ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10","apa":"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","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"title":"Planar matchings for weighted straight skeletons","acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","quality_controlled":"1","publisher":"Springer Nature","year":"2014","publication":"25th International Symposium, ISAAC 2014","day":"08","page":"117-127","date_created":"2022-03-21T07:09:03Z","date_published":"2014-11-08T00:00:00Z","doi":"10.1007/978-3-319-13075-0_10"},{"citation":{"mla":"Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-319-05957-0.","short":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.","ieee":"H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed. Cham: Springer Nature, 2014.","apa":"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","ama":"Edelsbrunner H. A Short Course in Computational Geometry and Topology. 1st ed. Cham: Springer Nature; 2014. doi:10.1007/978-3-319-05957-0","chicago":"Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed. SpringerBriefs in Applied Sciences and Technology. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-05957-0.","ista":"Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p."},"date_updated":"2022-03-04T07:47:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"title":"A Short Course in Computational Geometry and Topology","department":[{"_id":"HeEd"}],"_id":"6853","series_title":"SpringerBriefs in Applied Sciences and Technology","type":"book","status":"public","publication_status":"published","year":"2014","publication_identifier":{"eisbn":["9-783-3190-5957-0"],"issn":["2191-530X"],"isbn":["9-783-3190-5956-3"],"eissn":["2191-5318"]},"language":[{"iso":"eng"}],"day":"01","page":"IX, 110","date_created":"2019-09-06T09:22:33Z","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/978-3-319-05957-0","related_material":{"link":[{"description":"available as eBook via catalog IST BookList","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=356106","relation":"other"},{"description":"available via catalog IST BookList","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=373842","relation":"other"}]},"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."}],"oa_version":"None","edition":"1","alternative_title":["SpringerBriefs in Applied Sciences and Technology"],"publisher":"Springer Nature","quality_controlled":"1","scopus_import":"1","place":"Cham","month":"01"},{"date_created":"2022-03-18T13:05:39Z","doi":"10.1007/978-3-319-04099-8_16","date_published":"2014-03-19T00:00:00Z","page":"249-262","language":[{"iso":"eng"}],"publication":"Topological Methods in Data Analysis and Visualization III ","day":"19","publication_status":"published","year":"2014","publication_identifier":{"isbn":["9783319040981"],"eissn":["2197-666X"],"issn":["1612-3786"],"eisbn":["9783319040998"]},"month":"03","alternative_title":["Mathematics and Visualization"],"quality_controlled":"1","scopus_import":"1","publisher":"Springer","acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","oa_version":"None","abstract":[{"text":"We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set.","lang":"eng"}],"title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","department":[{"_id":"HeEd"}],"article_processing_charge":"No","author":[{"last_name":"Zobel","full_name":"Zobel, Valentin","first_name":"Valentin"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.","chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In Topological Methods in Data Analysis and Visualization III , 249–62. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_16.","apa":"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","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: Topological Methods in Data Analysis and Visualization III . Springer; 2014:249-262. doi:10.1007/978-3-319-04099-8_16","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in Topological Methods in Data Analysis and Visualization III , 2014, pp. 249–262.","short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16."},"date_updated":"2023-09-05T14:13:16Z","status":"public","type":"conference","_id":"10886"},{"year":"2014","day":"19","publication":"Topological Methods in Data Analysis and Visualization III.","page":"135-150","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_9","date_created":"2022-03-04T08:33:57Z","acknowledgement":"This research is supported and funded by the Digiteo unTopoVis project, the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC.","publisher":"Springer Nature","quality_controlled":"1","citation":{"ista":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization III. , 135–150.","chicago":"Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf. “Notes on the Simplification of the Morse-Smale Complex.” In Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-04099-8_9.","short":"D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III., Springer Nature, Cham, 2014, pp. 135–150.","ieee":"D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the simplification of the Morse-Smale complex,” in Topological Methods in Data Analysis and Visualization III., P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.","ama":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III. Mathematics and Visualization. Cham: Springer Nature; 2014:135-150. doi:10.1007/978-3-319-04099-8_9","apa":"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","mla":"Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.” Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:10.1007/978-3-319-04099-8_9."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"David","full_name":"Günther, David","last_name":"Günther"},{"first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","last_name":"Reininghaus"},{"first_name":"Hans-Peter","full_name":"Seidel, Hans-Peter","last_name":"Seidel"},{"first_name":"Tino","full_name":"Weinkauf, Tino","last_name":"Weinkauf"}],"article_processing_charge":"No","title":"Notes on the simplification of the Morse-Smale complex","editor":[{"first_name":"Peer-Timo","last_name":"Bremer","full_name":"Bremer, Peer-Timo"},{"full_name":"Hotz, Ingrid","last_name":"Hotz","first_name":"Ingrid"},{"first_name":"Valerio","full_name":"Pascucci, Valerio","last_name":"Pascucci"},{"full_name":"Peikert, Ronald","last_name":"Peikert","first_name":"Ronald"}],"project":[{"call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems"}],"publication_identifier":{"eisbn":["9783319040998"],"isbn":["9783319040981"],"eissn":["2197-666X"],"issn":["1612-3786"]},"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"abstract":[{"text":"The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.","lang":"eng"}],"oa_version":"None","scopus_import":"1","month":"03","place":"Cham","date_updated":"2023-09-05T15:33:45Z","department":[{"_id":"HeEd"}],"series_title":"Mathematics and Visualization","_id":"10817","type":"book_chapter","status":"public"},{"project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp. 164–177, 2014.","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","apa":"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","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 2014;50(1):164-177. doi:10.1007/s10851-013-0468-x","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision. Springer, 2014. https://doi.org/10.1007/s10851-013-0468-x.","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","last_name":"Pausinger"}],"publist_id":"4691","title":"Stable length estimates of tube-like shapes","quality_controlled":"1","publisher":"Springer","oa":1,"has_accepted_license":"1","year":"2014","day":"01","publication":"Journal of Mathematical Imaging and Vision","page":"164 - 177","doi":"10.1007/s10851-013-0468-x","date_published":"2014-09-01T00:00:00Z","date_created":"2018-12-11T11:56:36Z","_id":"2255","type":"journal_article","status":"public","pubrep_id":"549","date_updated":"2023-09-07T11:41:25Z","ddc":["000"],"file_date_updated":"2020-07-14T12:45:35Z","department":[{"_id":"HeEd"}],"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"}],"oa_version":"Submitted Version","scopus_import":1,"month":"09","intvolume":" 50","publication_identifier":{"issn":["09249907"]},"publication_status":"published","file":[{"date_updated":"2020-07-14T12:45:35Z","file_size":3941391,"creator":"system","date_created":"2018-12-12T10:16:18Z","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5204","checksum":"2f93f3e63a38a85cd4404d7953913b14"}],"language":[{"iso":"eng"}],"issue":"1","related_material":{"record":[{"relation":"earlier_version","id":"2843","status":"public"},{"status":"public","id":"1399","relation":"dissertation_contains"}]},"volume":50,"ec_funded":1},{"year":"2014","publication":"ICMS 2014: International Congress on Mathematical Software","day":"01","page":"137-143","date_created":"2022-03-21T07:12:16Z","date_published":"2014-09-01T00:00:00Z","doi":"10.1007/978-3-662-44199-2_24","publisher":"Springer Berlin Heidelberg","quality_controlled":"1","citation":{"mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","apa":"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","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: ICMS 2014: International Congress on Mathematical Software. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:10.1007/978-3-662-44199-2_24","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. https://doi.org/10.1007/978-3-662-44199-2_24.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","full_name":"Kerber, Michael","last_name":"Kerber"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Hubert","last_name":"Wagner","full_name":"Wagner, Hubert"}],"title":"PHAT – Persistent Homology Algorithms Toolbox","publication_status":"published","publication_identifier":{"isbn":["9783662441985"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783662441992"]},"language":[{"iso":"eng"}],"volume":8592,"related_material":{"record":[{"status":"public","id":"1433","relation":"later_version"}]},"abstract":[{"lang":"eng","text":"PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations."}],"oa_version":"None","scopus_import":"1","intvolume":" 8592","month":"09","place":"Berlin, Heidelberg","date_updated":"2023-09-20T09:42:40Z","department":[{"_id":"HeEd"}],"series_title":"LNCS","_id":"10894","conference":{"start_date":"2014-08-05","location":"Seoul, South Korea","end_date":"2014-08-09","name":"ICMS: International Congress on Mathematical Software"},"type":"conference","status":"public"},{"day":"01","publication":"arXiv","language":[{"iso":"eng"}],"year":"2014","publication_status":"submitted","date_published":"2014-01-01T00:00:00Z","doi":"10.48550/arXiv.1401.0468","date_created":"2018-12-11T11:55:12Z","oa_version":"Submitted Version","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","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"}],"month":"01","main_file_link":[{"open_access":"1","url":"http://cccg.ca/proceedings/2014/papers/paper23.pdf"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv. doi:10.48550/arXiv.1401.0468","apa":"Iglesias Ham, M., Kerber, M., & Uhler, C. (n.d.). Sphere packing with limited overlap. arXiv. https://doi.org/10.48550/arXiv.1401.0468","ieee":"M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” arXiv. .","short":"M. Iglesias Ham, M. Kerber, C. Uhler, ArXiv (n.d.).","mla":"Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.” ArXiv, 1401.0468, doi:10.48550/arXiv.1401.0468.","ista":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468.","chicago":"Iglesias Ham, Mabel, Michael Kerber, and Caroline Uhler. “Sphere Packing with Limited Overlap.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1401.0468."},"date_updated":"2023-10-18T08:06:45Z","title":"Sphere packing with limited overlap","department":[{"_id":"HeEd"},{"_id":"CaUh"}],"author":[{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael"},{"orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","last_name":"Uhler","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5064","article_processing_charge":"No","external_id":{"arxiv":["1401.0468"]},"article_number":"1401.0468","_id":"2012","status":"public","type":"preprint"},{"publist_id":"4763","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"}],"title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:56:00Z","citation":{"short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11","apa":"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","mla":"Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.","ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"ISVD: Voronoi Diagrams in Science and Engineering","end_date":"2013-07-10","location":"St. Petersburg, Russia","start_date":"2013-07-08"},"type":"conference","status":"public","_id":"2209","page":"37 - 46","date_created":"2018-12-11T11:56:20Z","doi":"10.1109/ISVD.2013.11","date_published":"2013-12-01T00:00:00Z","publication_status":"published","year":"2013","publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"language":[{"iso":"eng"}],"day":"01","scopus_import":1,"publisher":"IEEE","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"quality_controlled":"1","month":"12","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n"}],"oa_version":"None"},{"oa_version":"Submitted Version","abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.","lang":"eng"}],"month":"03","publisher":"TU Braunschweig","oa":1,"main_file_link":[{"url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf","open_access":"1"}],"day":"01","language":[{"iso":"eng"}],"publication":"29th European Workshop on Computational Geometry","year":"2013","publication_status":"published","date_published":"2013-03-01T00:00:00Z","date_created":"2018-12-11T11:56:21Z","page":"95 - 98","_id":"2210","status":"public","type":"conference","conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2013-03-17","end_date":"2013-03-20","location":"Braunschweig, Germany"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:00Z","citation":{"ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In 29th European Workshop on Computational Geometry, 95–98. TU Braunschweig, 2013.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: 29th European Workshop on Computational Geometry. TU Braunschweig; 2013:95-98.","apa":"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.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig, Germany, 2013, pp. 95–98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98."},"department":[{"_id":"HeEd"}],"title":"Reconstructing polygons from embedded straight skeletons","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814"}],"publist_id":"4762"},{"acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","oa_version":"None","abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}],"intvolume":" 43","month":"09","quality_controlled":"1","publisher":"Elsevier","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Electronic Notes in Discrete Mathematics","day":"05","year":"2013","publication_status":"published","date_created":"2018-12-11T11:56:53Z","doi":"10.1016/j.endm.2013.07.008","date_published":"2013-09-05T00:00:00Z","volume":43,"page":"43 - 50","_id":"2304","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:39Z","citation":{"chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ama":"Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008","apa":"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"},"title":"Van der Corput sequences and linear permutations","department":[{"_id":"HeEd"}],"author":[{"last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4623"},{"citation":{"chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In 45th Annual ACM Symposium on Theory of Computing, 595–604. ACM, 2013. https://doi.org/10.1145/2488608.2488683.","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.” 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604, doi:10.1145/2488608.2488683.","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 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.","apa":"Čadek, M., Krcál, M., Matoušek, 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","ama":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: 45th Annual ACM Symposium on Theory of Computing. ACM; 2013:595-604. doi:10.1145/2488608.2488683"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Martin","last_name":"Čadek","full_name":"Čadek, Martin"},{"last_name":"Krcál","full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek"},{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"last_name":"Vokřínek","full_name":"Vokřínek, Lukáš","first_name":"Lukáš"},{"last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"4078","title":"Extending continuous maps: Polynomiality and undecidability","quality_controlled":"1","publisher":"ACM","oa":1,"has_accepted_license":"1","year":"2013","day":"01","publication":"45th Annual ACM Symposium on theory of computing","page":"595 - 604","doi":"10.1145/2488608.2488683","date_published":"2013-06-01T00:00:00Z","date_created":"2018-12-11T11:59:42Z","_id":"2807","type":"conference","conference":{"name":"STOC: Symposium on the Theory of Computing","end_date":"2013-06-04","location":"Palo Alto, CA, United States","start_date":"2013-06-01"},"status":"public","pubrep_id":"533","date_updated":"2021-01-12T06:59:51Z","ddc":["510"],"file_date_updated":"2020-07-14T12:45:48Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"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" (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. "}],"oa_version":"Submitted Version","scopus_import":1,"month":"06","publication_status":"published","file":[{"file_id":"5081","checksum":"06c2ce5c1135fbc1f71ca15eeb242dcf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-533-v1+1_Extending_continuous_maps_polynomiality_and_undecidability.pdf","date_created":"2018-12-12T10:14:29Z","creator":"system","file_size":447945,"date_updated":"2020-07-14T12:45:48Z"}],"language":[{"iso":"eng"}]},{"publist_id":"4072","author":[{"first_name":"Dominique","last_name":"Attali","full_name":"Attali, Dominique"},{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer"},{"first_name":"Olivier","full_name":"Devillers, Olivier","last_name":"Devillers"},{"first_name":"Marc","last_name":"Glisse","full_name":"Glisse, Marc"},{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"}],"department":[{"_id":"HeEd"}],"title":"Homological reconstruction and simplification in R3","citation":{"mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Proceedings of the 29th Annual Symposium on Computational Geometry, ACM, 2013, pp. 117–25, doi:10.1145/2462356.2462373.","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” in Proceedings of the 29th annual symposium on Computational Geometry, Rio de Janeiro, Brazil, 2013, pp. 117–125.","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.","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. In: Proceedings of the 29th Annual Symposium on Computational Geometry. ACM; 2013:117-125. doi:10.1145/2462356.2462373","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2013). Homological reconstruction and simplification in R3. 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","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” In Proceedings of the 29th Annual Symposium on Computational Geometry, 117–25. ACM, 2013. https://doi.org/10.1145/2462356.2462373.","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."},"date_updated":"2023-02-23T10:15:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2013-06-17","end_date":"2013-06-20","location":"Rio de Janeiro, Brazil","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","_id":"2812","page":"117 - 125","date_created":"2018-12-11T11:59:44Z","date_published":"2013-06-01T00:00:00Z","doi":"10.1145/2462356.2462373","related_material":{"record":[{"relation":"later_version","id":"1805","status":"public"}]},"publication_status":"published","year":"2013","language":[{"iso":"eng"}],"publication":"Proceedings of the 29th annual symposium on Computational Geometry","day":"01","main_file_link":[{"open_access":"1","url":"http://hal.archives-ouvertes.fr/hal-00833791/"}],"oa":1,"publisher":"ACM","quality_controlled":"1","scopus_import":1,"month":"06","abstract":[{"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.","lang":"eng"}],"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).","oa_version":"Submitted Version"},{"publist_id":"3979","author":[{"full_name":"Topp, Christopher","last_name":"Topp","first_name":"Christopher"},{"first_name":"Anjali","full_name":"Iyer Pascuzzi, Anjali","last_name":"Iyer Pascuzzi"},{"first_name":"Jill","last_name":"Anderson","full_name":"Anderson, Jill"},{"first_name":"Cheng","last_name":"Lee","full_name":"Lee, Cheng"},{"first_name":"Paul","full_name":"Zurek, Paul","last_name":"Zurek"},{"last_name":"Symonova","full_name":"Symonova, Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga"},{"full_name":"Zheng, Ying","last_name":"Zheng","first_name":"Ying"},{"full_name":"Bucksch, Alexander","last_name":"Bucksch","first_name":"Alexander"},{"first_name":"Yuriy","full_name":"Mileyko, Yuriy","last_name":"Mileyko"},{"full_name":"Galkovskyi, Taras","last_name":"Galkovskyi","first_name":"Taras"},{"full_name":"Moore, Brad","last_name":"Moore","first_name":"Brad"},{"last_name":"Harer","full_name":"Harer, John","first_name":"John"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"first_name":"Thomas","full_name":"Mitchell Olds, Thomas","last_name":"Mitchell Olds"},{"first_name":"Joshua","full_name":"Weitz, Joshua","last_name":"Weitz"},{"first_name":"Philip","full_name":"Benfey, Philip","last_name":"Benfey"}],"external_id":{"pmid":["25673779"]},"title":"3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture","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.","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.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1304354110.","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. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1304354110","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. PNAS. 2013;110(18):E1695-E1704. doi:10.1073/pnas.1304354110","ieee":"C. Topp et al., “3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture,” PNAS, vol. 110, no. 18. National Academy of Sciences, pp. E1695–E1704, 2013.","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.” PNAS, vol. 110, no. 18, National Academy of Sciences, 2013, pp. E1695–704, doi:10.1073/pnas.1304354110."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"National Academy of Sciences","oa":1,"page":"E1695 - E1704","date_published":"2013-04-30T00:00:00Z","doi":"10.1073/pnas.1304354110","date_created":"2018-12-11T11:59:47Z","year":"2013","day":"30","publication":"PNAS","type":"journal_article","status":"public","_id":"2822","department":[{"_id":"MaJö"},{"_id":"HeEd"}],"date_updated":"2021-01-12T06:59:58Z","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4378147/"}],"month":"04","intvolume":" 110","abstract":[{"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 >1,400 3D root models and >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.","lang":"eng"}],"pmid":1,"oa_version":"Submitted Version","volume":110,"issue":"18","publication_status":"published","language":[{"iso":"eng"}]},{"day":"21","language":[{"iso":"eng"}],"publication":"17th IAPR International Conference on Discrete Geometry for Computer Imagery","publication_status":"published","year":"2013","doi":"10.1007/978-3-642-37067-0","volume":7749,"date_published":"2013-02-21T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"2255"}]},"date_created":"2018-12-11T11:59:53Z","page":"XV - XIX","oa_version":"None","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."}],"month":"02","intvolume":" 7749","alternative_title":["LNCS"],"quality_controlled":"1","scopus_import":1,"publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” In 17th IAPR International Conference on Discrete Geometry for Computer Imagery, 7749:XV–XIX. Springer, 2013. https://doi.org/10.1007/978-3-642-37067-0.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” in 17th IAPR International Conference on Discrete Geometry for Computer Imagery, 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.","apa":"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","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. In: 17th IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 7749. Springer; 2013:XV-XIX. doi:10.1007/978-3-642-37067-0","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” 17th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 7749, Springer, 2013, pp. XV–XIX, doi:10.1007/978-3-642-37067-0."},"date_updated":"2023-02-23T10:35:00Z","department":[{"_id":"HeEd"}],"title":"Stable length estimates of tube-like shapes","publist_id":"3952","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"_id":"2843","status":"public","type":"conference","conference":{"name":"DGCI: Discrete Geometry for Computer Imagery","location":"Seville, Spain","end_date":"2013-03-22","start_date":"2013-03-20"}},{"month":"05","intvolume":" 15","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1102.3389v1","open_access":"1"}],"oa_version":"Preprint","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."}],"issue":"1","volume":15,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"2859","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:00:18Z","publisher":"International Press","quality_controlled":"1","oa":1,"doi":"10.4310/HHA.2013.v15.n1.a3","date_published":"2013-05-01T00:00:00Z","date_created":"2018-12-11T11:59:58Z","page":"51 - 72","day":"01","publication":"Homology, Homotopy and Applications","year":"2013","title":"Homology and robustness of level and interlevel sets","publist_id":"3930","author":[{"last_name":"Bendich","full_name":"Bendich, Paul","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Morozov","full_name":"Morozov, Dmitriy","first_name":"Dmitriy"},{"id":"34A254A0-F248-11E8-B48F-1D18A9856A87","first_name":"Amit","last_name":"Patel","full_name":"Patel, Amit"}],"external_id":{"arxiv":["1102.3389"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi:10.4310/HHA.2013.v15.n1.a3.","apa":"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","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 2013;15(1):51-72. doi:10.4310/HHA.2013.v15.n1.a3","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” Homology, Homotopy and Applications, vol. 15, no. 1. International Press, pp. 51–72, 2013.","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.” Homology, Homotopy and Applications. International Press, 2013. https://doi.org/10.4310/HHA.2013.v15.n1.a3.","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."}},{"title":"Genotypic recognition and spatial responses by rice roots","external_id":{"pmid":["23362379"]},"article_processing_charge":"No","publist_id":"3872","author":[{"full_name":"Fang, Suqin","last_name":"Fang","first_name":"Suqin"},{"full_name":"Clark, Randy","last_name":"Clark","first_name":"Randy"},{"full_name":"Zheng, Ying","last_name":"Zheng","first_name":"Ying"},{"full_name":"Iyer Pascuzzi, Anjali","last_name":"Iyer Pascuzzi","first_name":"Anjali"},{"full_name":"Weitz, Joshua","last_name":"Weitz","first_name":"Joshua"},{"full_name":"Kochian, Leon","last_name":"Kochian","first_name":"Leon"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Liao, Hong","last_name":"Liao","first_name":"Hong"},{"full_name":"Benfey, Philip","last_name":"Benfey","first_name":"Philip"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ieee":"S. Fang et al., “Genotypic recognition and spatial responses by rice roots,” PNAS, vol. 110, no. 7. National Academy of Sciences, pp. 2670–2675, 2013.","ama":"Fang S, Clark R, Zheng Y, et al. Genotypic recognition and spatial responses by rice roots. PNAS. 2013;110(7):2670-2675. doi:10.1073/pnas.1222821110","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. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1222821110","mla":"Fang, Suqin, et al. “Genotypic Recognition and Spatial Responses by Rice Roots.” PNAS, vol. 110, no. 7, National Academy of Sciences, 2013, pp. 2670–75, doi:10.1073/pnas.1222821110.","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.","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.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1222821110."},"oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1","date_created":"2018-12-11T12:00:09Z","doi":"10.1073/pnas.1222821110","date_published":"2013-02-12T00:00:00Z","page":"2670 - 2675","publication":"PNAS","day":"12","year":"2013","status":"public","type":"journal_article","article_type":"original","_id":"2887","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:00:29Z","intvolume":" 110","month":"02","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3574932/","open_access":"1"}],"scopus_import":1,"oa_version":"Published Version","pmid":1,"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."}],"issue":"7","volume":110,"language":[{"iso":"eng"}],"publication_status":"published"},{"date_updated":"2021-01-12T07:00:35Z","citation":{"short":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, JMLR, 2013, pp. 161–169.","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.","apa":"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.","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.","mla":"Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. 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&CP, vol. 31, 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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3846","author":[{"first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"first_name":"Zhu","full_name":"Yan, Zhu","last_name":"Yan"},{"full_name":"Metaxas, Dimitris","last_name":"Metaxas","first_name":"Dimitris"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"title":"Computing the M most probable modes of a graphical model","department":[{"_id":"HeEd"},{"_id":"VlKo"},{"_id":"ChLa"}],"_id":"2901","conference":{"start_date":"2013-04-29","location":"Scottsdale, AZ, United States","end_date":"2013-05-01","name":" AISTATS: Conference on Uncertainty in Artificial Intelligence"},"type":"conference","status":"public","year":"2013","publication_status":"published","language":[{"iso":"eng"}],"day":"01","page":"161 - 169","date_created":"2018-12-11T12:00:14Z","date_published":"2013-01-01T00:00:00Z","volume":31,"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"}],"oa_version":"None","main_file_link":[{"url":"http://jmlr.org/proceedings/papers/v31/chen13a.html","open_access":"1"}],"oa":1,"alternative_title":[" JMLR: W&CP"],"scopus_import":1,"quality_controlled":"1","publisher":"JMLR","intvolume":" 31","month":"01"},{"page":"70 - 77","doi":"10.1137/1.9781611972931.6","date_published":"2013-01-01T00:00:00Z","date_created":"2018-12-11T12:00:16Z","has_accepted_license":"1","year":"2013","day":"01","publication":"2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments","quality_controlled":"1","publisher":"Society of Industrial and Applied Mathematics","oa":1,"publist_id":"3841","author":[{"first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"title":"3D kinetic alpha complexes and their implementation","citation":{"mla":"Kerber, Michael, and Herbert Edelsbrunner. “3D Kinetic Alpha Complexes and Their Implementation.” 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77, doi:10.1137/1.9781611972931.6.","apa":"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","ama":"Kerber M, Edelsbrunner H. 3D kinetic alpha complexes and their implementation. In: 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. Society of Industrial and Applied Mathematics; 2013:70-77. doi:10.1137/1.9781611972931.6","ieee":"M. Kerber and H. Edelsbrunner, “3D kinetic alpha complexes and their implementation,” in 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2013, pp. 70–77.","short":"M. Kerber, H. Edelsbrunner, in:, 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77.","chicago":"Kerber, Michael, and Herbert Edelsbrunner. “3D Kinetic Alpha Complexes and Their Implementation.” In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, 70–77. Society of Industrial and Applied Mathematics, 2013. https://doi.org/10.1137/1.9781611972931.6.","ista":"Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","file":[{"file_id":"4720","checksum":"a15a3ba22df9445731507f3e06c9fcee","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:57Z","file_name":"IST-2016-547-v1+1_2013-P-08-MedusaII.pdf","date_updated":"2020-07-14T12:45:52Z","file_size":403013,"creator":"system"}],"language":[{"iso":"eng"}],"alternative_title":["ALENEX"],"scopus_import":1,"month":"01","abstract":[{"lang":"eng","text":"Motivated by an application in cell biology, we describe an extension of the kinetic data structures framework from Delaunay triangulations to fixed-radius alpha complexes. Our algorithm is implemented\r\nusing CGAL, following the exact geometric computation paradigm. We report on several\r\ntechniques to accelerate the computation that turn our implementation applicable to the underlying biological\r\nproblem."}],"oa_version":"Submitted Version","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:52Z","date_updated":"2021-01-12T07:00:36Z","ddc":["500"],"type":"conference","conference":{"name":"ALENEX: Algorithm Engineering and Experiments","start_date":"2013-01-07","end_date":"2013-01-07","location":"New Orleans, LA, United States"},"status":"public","pubrep_id":"547","_id":"2906"},{"date_published":"2013-06-01T00:00:00Z","doi":"10.1007/s00454-013-9517-x","date_created":"2018-12-11T11:59:44Z","page":"797 - 822","day":"01","publication":"Discrete & Computational Geometry","year":"2013","publisher":"Springer","quality_controlled":"1","oa":1,"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.","title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Brittany Terese","id":"F65D502E-E68D-11E9-9252-C644099818F6","last_name":"Fasy","full_name":"Fasy, Brittany Terese"},{"last_name":"Rote","full_name":"Rote, Günter","first_name":"Günter"}],"publist_id":"3991","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Discrete & Computational Geometry, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi:10.1007/s00454-013-9517-x.","ieee":"H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” Discrete & Computational Geometry, vol. 49, no. 4. Springer, pp. 797–822, 2013.","short":"H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete & Computational Geometry 49 (2013) 797–822.","apa":"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","ama":"Edelsbrunner H, Fasy BT, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete & Computational Geometry. 2013;49(4):797-822. doi:10.1007/s00454-013-9517-x","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.” Discrete & Computational Geometry. Springer, 2013. https://doi.org/10.1007/s00454-013-9517-x.","ista":"Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete & Computational Geometry. 49(4), 797–822."},"volume":49,"related_material":{"record":[{"status":"public","id":"3134","relation":"earlier_version"}]},"issue":"4","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"publication_status":"published","month":"06","intvolume":" 49","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-013-9517-x"}],"oa_version":"Published Version","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."}],"department":[{"_id":"HeEd"}],"date_updated":"2023-02-23T11:13:49Z","status":"public","type":"journal_article","article_type":"original","_id":"2815"},{"status":"public","type":"journal_article","_id":"2939","title":"An output sensitive algorithm for persistent homology","department":[{"_id":"HeEd"}],"publist_id":"3796","author":[{"full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kerber","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"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","ama":"Chen C, Kerber M. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 2013;46(4):435-447. doi:10.1016/j.comgeo.2012.02.010","short":"C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.","ieee":"C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4. Elsevier, pp. 435–447, 2013.","mla":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” Computational Geometry: Theory and Applications, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:10.1016/j.comgeo.2012.02.010.","ista":"Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447.","chicago":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.” Computational Geometry: Theory and Applications. Elsevier, 2013. https://doi.org/10.1016/j.comgeo.2012.02.010."},"date_updated":"2023-02-23T11:24:10Z","intvolume":" 46","month":"05","quality_controlled":"1","publisher":"Elsevier","scopus_import":1,"acknowledgement":"The authors thank Herbert Edelsbrunner for many helpful discussions and suggestions. Moreover, they are grateful for the careful reviews that helped to improve the quality of the paper.","oa_version":"None","abstract":[{"lang":"eng","text":"In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0, 1), the running time is O (C (1 - δ) Γ R d (n) log n), where C (1 - δ) Γ is the number of homology classes with persistence at least (1 - δ) Γ, n is the total number of simplices in the complex, d its dimension, and R d (n) is the complexity of computing the rank of an n × n matrix with O (d n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O (C (1 - δ) Γ n 2.376) algorithm, an O (C (1 - δ) Γ n 2.28) Las-Vegas algorithm, or an O (C (1 - δ) Γ n 2 + ε{lunate}) Monte-Carlo algorithm for an arbitrary ε{lunate} > 0. The space complexity of the Monte-Carlo version is bounded by O (d n) = O (n log n)."}],"date_created":"2018-12-11T12:00:27Z","date_published":"2013-05-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"3367","relation":"earlier_version"}]},"volume":46,"issue":"4","doi":"10.1016/j.comgeo.2012.02.010","page":"435 - 447","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","day":"01","publication_status":"published","year":"2013"},{"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"This research is partially supported by the European Science Foundation (ESF) under the Research Network Programme, the European Union under the Toposys Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.","date_created":"2022-03-21T07:30:33Z","date_published":"2013-06-01T00:00:00Z","doi":"10.1007/978-3-642-38221-5_19","page":"182-183","publication":"Graph-Based Representations in Pattern Recognition","day":"01","year":"2013","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"title":"Persistent homology in image processing","article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877, pp. 182–183.","short":"H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.","apa":"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","ama":"Edelsbrunner H. Persistent homology in image processing. In: Graph-Based Representations in Pattern Recognition. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:10.1007/978-3-642-38221-5_19","mla":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.","ista":"Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.","chicago":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In Graph-Based Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-38221-5_19."},"intvolume":" 7877","place":"Berlin, Heidelberg","month":"06","scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing."}],"ec_funded":1,"volume":7877,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["9783642382215"],"isbn":["9783642382208"],"eissn":["1611-3349"],"issn":["0302-9743"]},"status":"public","conference":{"name":"GbRPR: Graph-based Representations in Pattern Recognition","location":"Vienna, Austria","end_date":"2013-05-17","start_date":"2013-05-15"},"type":"conference","series_title":"LNCS","_id":"10897","department":[{"_id":"HeEd"}],"date_updated":"2023-09-05T15:10:20Z"}]