{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T13:45:42Z","timestamp":1748958342608},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319323596"},{"type":"electronic","value":"9783319323602"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32360-2_12","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T23:15:41Z","timestamp":1460157341000},"page":"154-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two Measures for the Homology Groups of\u00a0Binary Volumes"],"prefix":"10.1007","author":[{"given":"Aldo","family":"Gonzalez-Lorenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Bac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Luc","family":"Mari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Real","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/34.391389","volume":"17","author":"H Breu","year":"1995","unstructured":"Breu, H., Gil, J., Kirkpatrick, D., Werman, M.: Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17, 529\u2013533 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0734-189X(84)90035-5","volume":"27","author":"G Borgefors","year":"1984","unstructured":"Borgefors, G.: Distance transformations in arbitrary dimensions. Comput. Vis. Graph. Image Process. 27(3), 321\u2013345 (1984)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2009.06.004","volume":"43","author":"C Chen","year":"2010","unstructured":"Chen, C., Freedman, D.: Measuring and computing natural generators for homology groups. Comput. Geom. 43(2), 169\u2013181 (2010). Special Issue on the 24th European Workshop on Computational Geometry (EuroCG 2008)","journal-title":"Comput. Geom."},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2461912.2462017","volume":"32","author":"TK Dey","year":"2013","unstructured":"Dey, T.K., Fan, F., Wang, Y.: An efficient computation of handle and tunnel loops via Reeb graphs. ACM Trans. Graph. 32(4), 32:1\u201332:10 (2013)","journal-title":"ACM Trans. Graph."},{"key":"12_CR5","unstructured":"DGtal: Digital geometry tools and algorithms library. \n                      http:\/\/dgtal.org"},{"key":"12_CR6","series-title":"Contemporary Mathematics","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1090\/conm\/453\/08802","volume-title":"Surveys on Discrete and Computational Geometry: Twenty Years Later","author":"H Edelsbrunner","year":"2008","unstructured":"Edelsbrunner, H., Harer, J.: Persistent homology - a survey. In: Pach, J., Goodman, J.E., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, pp. 257\u2013282. American Mathematical Society, Providence (2008)"},{"key":"12_CR7","unstructured":"Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 1038\u20131046. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"key":"12_CR8","unstructured":"Gaspard, J.: Roman colosseum completely detailed see the world, August 2015. Creative Commons License. \n                      https:\/\/www.thingiverse.com\/thing:962416"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1090\/S0273-0979-07-01191-3","volume":"45","author":"R Ghrist","year":"2008","unstructured":"Ghrist, R.: Barcodes: the persistent topology of data. Bull. Am. Math. Soc. 45, 61\u201375 (2008)","journal-title":"Bull. Am. Math. Soc."},{"key":"12_CR10","unstructured":"Gonzalez-Lorenzo, A.: \n                      http:\/\/aldo.gonzalez-lorenzo.perso.luminy.univ-amu.fr\/measures.html\n                      \n                    . Accessed 20 Oct 2015"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(96)00049-X","volume":"58","author":"T Hirata","year":"1996","unstructured":"Hirata, T.: A unified linear-time algorithm for computing distance maps. Inf. Process. Lett. 58(3), 129\u2013133 (1996)","journal-title":"Inf. Process. Lett."},{"key":"12_CR12","series-title":"Applied Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/b97315","volume-title":"Computational Homology","author":"Tomasz Kaczynski","year":"2004","unstructured":"Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational Homology, (chapters 2 and 7), vol. 157, pp. 255\u2013258. Springer, New York (2004)"},{"issue":"6\u20137","key":"12_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0167-8655(00)00022-2","volume":"21","author":"J Mukherjee","year":"2000","unstructured":"Mukherjee, J., Das, P.P., Aswatha Kumar, M., Chatterji, B.N.: On approximating Euclidean metrics by digital distances in 2D and 3D. Pattern Recogn. Lett. 21(6\u20137), 573\u2013582 (2000)","journal-title":"Pattern Recogn. Lett."},{"key":"12_CR14","unstructured":"Min, P.: Binvox, 3D mesh voxelizer. \n                      http:\/\/www.cs.princeton.edu\/~min\/binvox\/\n                      \n                    . Accessed 7 Oct 2015"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Milosavljevi\u0107, N., Morozov, D., Skraba, P.: Zigzag persistent homology in matrix multiplication time. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, SoCG 2011, pp. 216\u2013225. ACM, New York (2011)","DOI":"10.1145\/1998196.1998229"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s00454-013-9529-6","volume":"50","author":"K Mischaikow","year":"2013","unstructured":"Mischaikow, K., Nanda, V.: Morse theory for filtrations and efficient computation of persistent homology. Discrete Comput. Geom. 50(2), 330\u2013353 (2013)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1145\/321479.321486","volume":"15","author":"U Montanari","year":"1968","unstructured":"Montanari, U.: A method for obtaining skeletons using a quasi-Euclidean distance. J. ACM 15(4), 600\u2013624 (1968)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/TPAMI.2003.1177156","volume":"25","author":"CR Maurer Jr","year":"2003","unstructured":"Maurer Jr., C.R., Qi, R., Raghavan, V.: A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 25(2), 265\u2013270 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"12_CR19","series-title":"Computational Imaging and Vision","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/0-306-47025-X_36","volume-title":"Mathematical Morphology and its Applications to Image and Signal Processing","author":"A Meijster","year":"2000","unstructured":"Meijster, A., Roerdink, J., Hesselink, W.H.: A general algorithm for computing distance transforms in linear time. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol. 18, pp. 331\u2013340. Springer, New York (2000)"},{"key":"12_CR20","unstructured":"Nanda, V.: Perseus, the persistent homology software. \n                      http:\/\/www.sas.upenn.edu\/~vnanda\/perseus\n                      \n                    . Accessed 7 Oct 2015"},{"issue":"10","key":"12_CR21","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.patcog.2008.11.014","volume":"42","author":"N Normand","year":"2009","unstructured":"Normand, N., \u00c9venou, P.: Medial axis lookup table and test neighborhood computation for 3D chamfer norms. Pattern Recogn. 42(10), 2288\u20132296 (2009). Selected papers from the 14th IAPR International Conference on Discrete Geometry for Computer Imagery 2008","journal-title":"Pattern Recogn."},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TVCG.2003.1196006","volume":"9","author":"FS Nooruddin","year":"2003","unstructured":"Nooruddin, F.S., Turk, G.: Simplification and repair of polygonal models using volumetric techniques. IEEE Trans. Vis. Comput. Graph. 9(2), 191\u2013205 (2003)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"12_CR23","unstructured":"Reynolds, A.: Radiant blossom, August 2015. Creative Commons License. \n                      https:\/\/www.thingiverse.com\/thing:978768"},{"key":"12_CR24","series-title":"Mathematics and Visualization","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-23175-9_7","volume-title":"Topological Methods in Data Analysis and Visualization II","author":"H Wagner","year":"2012","unstructured":"Wagner, H., Chen, C., Vu\u00e7ini, E.: Efficient computation of persistent homology for cubical data. In: Peikert, R., Hauser, H., Carr, H., Fuchs, R. (eds.) Topological Methods in Data Analysis and Visualization II. Mathematics and Visualization, pp. 91\u2013106. Springer, Heidelberg (2012)"},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","volume":"33","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249\u2013274 (2005)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.comgeo.2008.02.003","volume":"41","author":"A Zomorodian","year":"2008","unstructured":"Zomorodian, A., Carlsson, G.: Localized homology. Comput. Geom. 41(3), 126\u2013148 (2008)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32360-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:03:27Z","timestamp":1586390607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32360-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319323596","9783319323602"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32360-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}