{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:37:30Z","timestamp":1760236650622,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,12,11]],"date-time":"2021-12-11T00:00:00Z","timestamp":1639180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We address the basic question in discrete Morse theory of combining discrete gradient fields that are partially defined on subsets of the given complex. This is a well-posed question when the discrete gradient field V is generated using a fixed algorithm which has a local nature. One example is ProcessLowerStars, a widely used algorithm for computing persistent homology associated to a grey-scale image in 2D or 3D. While the algorithm for V may be inherently local, being computed within stars of vertices and so embarrassingly parallelizable, in practical use, it is natural to want to distribute the computation over patches Pi, apply the chosen algorithm to compute the fields Vi associated to each patch, and then assemble the ambient field V from these. Simply merging the fields from the patches, even when that makes sense, gives a wrong answer. We develop both very general merging procedures and leaner versions designed for specific, easy-to-arrange covering patterns.<\/jats:p>","DOI":"10.3390\/a14120360","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T01:28:11Z","timestamp":1639358891000},"page":"360","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Merging Discrete Morse Vector Fields: A Case of Stubborn Geometric Parallelization"],"prefix":"10.3390","volume":"14","author":[{"given":"Douglas","family":"Lenseth","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, State University of New York, Albany, NY 12222, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6655-4549","authenticated-orcid":false,"given":"Boris","family":"Goldfarb","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, State University of New York, Albany, NY 12222, USA"}]}],"member":"1968","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"ref_1","unstructured":"Forman, R. (2002). A User\u2019s Guide to Discrete Morse Theory, S\u00e9minaire Lotharingien de Combinatoire, Institute f\u00fcr Mathematik, Universit\u00e4t Wien."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1109\/TPAMI.2011.95","article-title":"Theory and algorithms for constructing discrete Morse complexes from grayscale digital images","volume":"33","author":"Robins","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Knudson, K.P. (2015). Morse Theory: Smooth and Discrete, World Scientific.","DOI":"10.1142\/9360"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s00222-003-0356-x","article-title":"The integral K-theoretic Novikov conjecture for groups with finite asymptotic dimension","volume":"157","author":"Carlsson","year":"2004","journal-title":"Invent. Math."},{"key":"ref_5","first-page":"273","article-title":"Singular persistent homology with geometrically parallelizable computation","volume":"55","author":"Goldfarb","year":"2020","journal-title":"Topol. Proc."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0002-9947-02-03115-X","article-title":"On hypersphericity of manifolds with finite asymptotic dimension","volume":"355","author":"Dranishnikov","year":"2003","journal-title":"Trans. Am. Math. Soc."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kasprowski, D. (2021). Coarse embeddings into products of trees. arXiv.","DOI":"10.1215\/21562261-2022-0007"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Upadhyay, A., Wang, W., and Ekenna, C. (2019, January 4\u20138). Approximating cfree space topology by constructing Vietoris-Rips complex. Proceedings of the 2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2019), Macau, China.","DOI":"10.1109\/IROS40897.2019.8968148"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10586458.2005.10128941","article-title":"Generating discrete Morse functions from point data","volume":"14","author":"King","year":"2005","journal-title":"Exp. Math."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Upadhyay, A., Goldfarb, B., and Ekenna, C. (October, January 27). A topological approach to finding coarsely diverse paths. Proceedings of the 2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2021), Prague, Czech Republic.","DOI":"10.1109\/IROS51168.2021.9636714"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2014","DOI":"10.1109\/TVCG.2012.209","article-title":"Computing Morse-Smale Complexes with Accurate Geometry","volume":"18","author":"Gyulassy","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s00454-013-9529-6","article-title":"Morse Theory for Filtrations and Efficient Computation of Persistent Homology","volume":"50","author":"Mischaikow","year":"2013","journal-title":"Discr. Comput. Geom."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/TVCG.2008.110","article-title":"A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality","volume":"6","author":"Gyulassy","year":"2008","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/TVCG.2011.284","article-title":"Parallel Computation of 2D Morse-Smale Complexes","volume":"18","author":"Shivashankar","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Gr."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/12\/360\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:45:30Z","timestamp":1760168730000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/12\/360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,11]]},"references-count":14,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["a14120360"],"URL":"https:\/\/doi.org\/10.3390\/a14120360","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,12,11]]}}}