[{"oa_version":"None","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 18th International Symposium on Web and Wireless Geographical Information Systems, W2GIS 2022, held in Konstanz, Germany, in April 2022.\r\nThe 7 full papers presented together with 6 short papers in the volume were carefully reviewed and selected from 16 submissions. The papers cover topics that range from mobile GIS and Location-Based Services to Spatial Information Retrieval and Wireless Sensor Networks."}],"place":"Cham","month":"05","intvolume":" 13238","alternative_title":["LNCS"],"quality_controlled":"1","publisher":"Springer Nature","edition":"1","day":"01","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031062445"],"eissn":["1611-3349"],"eisbn":["9783031062452"]},"publication_status":"published","year":"2022","doi":"10.1007/978-3-031-06245-2","date_published":"2022-05-01T00:00:00Z","volume":13238,"date_created":"2022-06-02T05:40:53Z","page":"153","_id":"11429","status":"public","type":"book_editor","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Karimipour, Farid, and Sabine Storandt, editors. Web and Wireless Geographical Information Systems. 1st ed., vol. 13238, Springer Nature, 2022, doi:10.1007/978-3-031-06245-2.","ieee":"F. Karimipour and S. Storandt, Eds., Web and Wireless Geographical Information Systems, 1st ed., vol. 13238. Cham: Springer Nature, 2022.","short":"F. Karimipour, S. Storandt, eds., Web and Wireless Geographical Information Systems, 1st ed., Springer Nature, Cham, 2022.","ama":"Karimipour F, Storandt S, eds. Web and Wireless Geographical Information Systems. Vol 13238. 1st ed. Cham: Springer Nature; 2022. doi:10.1007/978-3-031-06245-2","apa":"Karimipour, F., & Storandt, S. (Eds.). (2022). Web and Wireless Geographical Information Systems (1st ed., Vol. 13238). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-06245-2","chicago":"Karimipour, Farid, and Sabine Storandt, eds. Web and Wireless Geographical Information Systems. 1st ed. Vol. 13238. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-031-06245-2.","ista":"Karimipour F, Storandt S eds. 2022. Web and Wireless Geographical Information Systems 1st ed., Cham: Springer Nature, 153p."},"date_updated":"2022-06-02T05:56:22Z","editor":[{"orcid":"0000-0001-6746-4174","full_name":"Karimipour, Farid","last_name":"Karimipour","first_name":"Farid","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425"},{"last_name":"Storandt","full_name":"Storandt, Sabine","first_name":"Sabine"}],"department":[{"_id":"HeEd"}],"title":"Web and Wireless Geographical Information Systems","article_processing_charge":"No"},{"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bleile, Bea, Adélie Garin, Teresa Heiss, Kelly Maggs, and Vanessa Robins. “The Persistent Homology of Dual Digital Image Constructions.” In Research in Computational Topology 2, edited by Ellen Gasparovic, Vanessa Robins, and Katharine Turner, 1st ed., 30:1–26. AWMS. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-95519-9_1.","ista":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. 2022.The persistent homology of dual digital image constructions. In: Research in Computational Topology 2. Association for Women in Mathematics Series, vol. 30, 1–26.","mla":"Bleile, Bea, et al. “The Persistent Homology of Dual Digital Image Constructions.” Research in Computational Topology 2, edited by Ellen Gasparovic et al., 1st ed., vol. 30, Springer Nature, 2022, pp. 1–26, doi:10.1007/978-3-030-95519-9_1.","short":"B. Bleile, A. Garin, T. Heiss, K. Maggs, V. Robins, in:, E. Gasparovic, V. Robins, K. Turner (Eds.), Research in Computational Topology 2, 1st ed., Springer Nature, Cham, 2022, pp. 1–26.","ieee":"B. Bleile, A. Garin, T. Heiss, K. Maggs, and V. Robins, “The persistent homology of dual digital image constructions,” in Research in Computational Topology 2, 1st ed., vol. 30, E. Gasparovic, V. Robins, and K. Turner, Eds. Cham: Springer Nature, 2022, pp. 1–26.","apa":"Bleile, B., Garin, A., Heiss, T., Maggs, K., & Robins, V. (2022). The persistent homology of dual digital image constructions. In E. Gasparovic, V. Robins, & K. Turner (Eds.), Research in Computational Topology 2 (1st ed., Vol. 30, pp. 1–26). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-95519-9_1","ama":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. The persistent homology of dual digital image constructions. In: Gasparovic E, Robins V, Turner K, eds. Research in Computational Topology 2. Vol 30. 1st ed. AWMS. Cham: Springer Nature; 2022:1-26. doi:10.1007/978-3-030-95519-9_1"},"editor":[{"first_name":"Ellen","last_name":"Gasparovic","full_name":"Gasparovic, Ellen"},{"last_name":"Robins","full_name":"Robins, Vanessa","first_name":"Vanessa"},{"first_name":"Katharine","full_name":"Turner, Katharine","last_name":"Turner"}],"title":"The persistent homology of dual digital image constructions","external_id":{"arxiv":["2102.11397"]},"article_processing_charge":"No","author":[{"last_name":"Bleile","full_name":"Bleile, Bea","first_name":"Bea"},{"first_name":"Adélie","last_name":"Garin","full_name":"Garin, Adélie"},{"full_name":"Heiss, Teresa","orcid":"0000-0002-1780-2689","last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa"},{"last_name":"Maggs","full_name":"Maggs, Kelly","first_name":"Kelly"},{"last_name":"Robins","full_name":"Robins, Vanessa","first_name":"Vanessa"}],"acknowledgement":"This project started during the Women in Computational Topology workshop held in Canberra in July of 2019. All authors are very grateful for its organisation and the financial support for the workshop from the Mathematical Sciences Institute at ANU, the US National Science Foundation through the award CCF-1841455, the Australian Mathematical Sciences Institute and the Association for Women in Mathematics. AG is supported by the Swiss National Science Foundation grant CRSII5_177237. TH is supported by the European Research Council (ERC) Horizon 2020 project “Alpha Shape Theory Extended” No. 788183. KM is supported by the ERC Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 859860. VR was supported by Australian Research Council Future Fellowship FT140100604 during the early stages of this project.","edition":"1","oa":1,"publisher":"Springer Nature","quality_controlled":"1","publication":"Research in Computational Topology 2","day":"27","year":"2022","date_created":"2022-06-07T08:21:11Z","date_published":"2022-01-27T00:00:00Z","doi":"10.1007/978-3-030-95519-9_1","page":"1-26","_id":"11440","series_title":"AWMS","status":"public","type":"book_chapter","date_updated":"2022-06-07T08:32:42Z","department":[{"_id":"HeEd"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation."}],"intvolume":" 30","place":"Cham","month":"01","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2102.11397","open_access":"1"}],"alternative_title":["Association for Women in Mathematics Series"],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["9783030955199"],"isbn":["9783030955182"]},"ec_funded":1,"volume":30},{"date_updated":"2023-01-30T13:02:30Z","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"_id":"12307","type":"journal_article","article_type":"original","keyword":["Education","General Mathematics"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["1935-4053"],"issn":["1051-1970"]},"language":[{"iso":"eng"}],"volume":32,"issue":"5","abstract":[{"text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.","lang":"eng"}],"oa_version":"None","scopus_import":"1","intvolume":" 32","month":"05","citation":{"mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022, pp. 593–609, doi:10.1080/10511970.2021.1872750.","apa":"Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS. 2022;32(5):593-609. doi:10.1080/10511970.2021.1872750","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750.","ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Shipman, Barbara A.","last_name":"Shipman","first_name":"Barbara A."},{"id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","full_name":"Stephenson, Elizabeth R"}],"title":"Tangible topology through the lens of limits","year":"2022","publication":"PRIMUS","day":"28","page":"593-609","date_created":"2023-01-16T10:07:21Z","date_published":"2022-05-28T00:00:00Z","doi":"10.1080/10511970.2021.1872750","publisher":"Taylor & Francis","quality_controlled":"1"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge."}],"intvolume":" 26","month":"06","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2022-08-22T06:42:42Z","file_size":694538,"date_created":"2022-08-22T06:42:42Z","file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"11940","checksum":"dc6e255e3558faff924fd9e370886c11","success":1}],"publication_status":"published","publication_identifier":{"issn":["1526-1719"]},"ec_funded":1,"issue":"2","related_material":{"record":[{"status":"public","id":"9296","relation":"earlier_version"}]},"volume":26,"_id":"11938","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)"},"article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2023-02-23T13:54:21Z","file_date_updated":"2022-08-22T06:42:42Z","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","oa":1,"publisher":"Brown University","quality_controlled":"1","publication":"Journal of Graph Algorithms and Applications","day":"01","year":"2022","has_accepted_license":"1","date_created":"2022-08-21T22:01:56Z","date_published":"2022-06-01T00:00:00Z","doi":"10.7155/jgaa.00591","page":"225-240","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ieee":"O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240."},"title":"On compatible matchings","article_processing_charge":"No","external_id":{"arxiv":["2101.03928"]},"author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"orcid":"0000-0003-2401-8670","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","last_name":"Masárová"},{"first_name":"Irene","full_name":"Parada, Irene","last_name":"Parada"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"first_name":"Alexander","full_name":"Pilz, Alexander","last_name":"Pilz"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}]},{"title":"The topological correctness of PL approximations of isomanifolds","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000673039600001"]},"author":[{"first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . Springer Nature. https://doi.org/10.1007/s10208-021-09520-0","ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012. doi:10.1007/s10208-021-09520-0","ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer Nature, pp. 967–1012, 2022.","short":"J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22 (2022) 967–1012.","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics , vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.","ista":"Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics . Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0."},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"date_created":"2021-07-14T06:44:53Z","date_published":"2022-01-01T00:00:00Z","doi":"10.1007/s10208-021-09520-0","page":"967-1012","publication":"Foundations of Computational Mathematics ","day":"01","year":"2022","isi":1,"has_accepted_license":"1","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411.","department":[{"_id":"HeEd"}],"file_date_updated":"2021-07-14T06:44:36Z","ddc":["516"],"date_updated":"2023-08-02T06:49:17Z","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","article_type":"original","_id":"9649","ec_funded":1,"volume":22,"related_material":{"record":[{"status":"public","id":"7952","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"file":[{"creator":"mwintrae","file_size":1455699,"date_updated":"2021-07-14T06:44:36Z","file_name":"Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf","date_created":"2021-07-14T06:44:36Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"9650","checksum":"f1d372ec3c08ec22e84f8e93e1126b8c"}],"publication_status":"published","publication_identifier":{"eissn":["1615-3383"]},"intvolume":" 22","month":"0","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently\r\nfine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary.","lang":"eng"}]}]