{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:03:29Z","timestamp":1750323809240},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T00:00:00Z","timestamp":1292457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00224-010-9306-3","type":"journal-article","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T18:57:39Z","timestamp":1292439459000},"page":"370-386","source":"Crossref","is-referenced-by-count":10,"title":["Computing Space-Filling Curves"],"prefix":"10.1007","volume":"50","author":[{"given":"P. J.","family":"Couch","sequence":"first","affiliation":[]},{"given":"B. D.","family":"Daniel","sequence":"additional","affiliation":[]},{"given":"Timothy H.","family":"McNicholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"issue":"2","key":"9306_CR1","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1016\/j.jmaa.2007.02.037","volume":"335","author":"P.C. Allaart","year":"2007","unstructured":"Allaart, P.C., Kawamura, K.: Dimensions of the coordinate functions of space-filling curves. J. Math. Anal. Appl. 335(2), 1161\u20131176 (2007)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"9306_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1328911.1328920","volume":"4","author":"L. Arge","year":"2008","unstructured":"Arge, L., de Berg, M., Haverkort, H., Yi, K.: The priority R-tree: a practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1), 30 (2008). Art. 9","journal-title":"ACM Trans. Algorithms"},{"issue":"7","key":"9306_CR3","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1016\/j.topol.2005.11.018","volume":"154","author":"T. Banakh","year":"2007","unstructured":"Banakh, T., Tuncali, M.: Controlled Hahn-Mazurkiewicz theorem and some new dimension functions of Peano continua. Topology Appl. 154(7), 1286\u20131297 (2007)","journal-title":"Topology Appl."},{"issue":"1","key":"9306_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/060658023","volume":"38","author":"V. Brattka","year":"2008","unstructured":"Brattka, V.: Plottable real number functions and the computable graph theorem. SIAM J. Comput. 38(1), 303\u2013328 (2008)","journal-title":"SIAM J. Comput."},{"key":"9306_CR5","unstructured":"Couch, P.: On a computable Hahn-Mazurkiewicz theorem. Masters thesis, Lamar University (2008)"},{"key":"9306_CR6","unstructured":"Daniel, D., McNicholl, T.: Effective local connectivity properties. Submitted"},{"key":"9306_CR7","series-title":"Informatik Berichte","first-page":"147","volume-title":"CCA 2009, Sixth International Conference on Computability and Complexity in Analysis","author":"X. Gu","year":"2009","unstructured":"Gu, X., Lutz, J., Mayordomo, E.: Curves that must be retraced. In: Bauer, A., Dillhage, R., Hertling, P., Ko, K., Rettinger, R. (eds.) CCA 2009, Sixth International Conference on Computability and Complexity in Analysis. Informatik Berichte, vol. 353, pp. 147\u2013158. Fern-Universit\u00e4t, Hagen (2009)"},{"issue":"5","key":"9306_CR8","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1137\/040604078","volume":"28","author":"F. G\u00fcnther","year":"2006","unstructured":"G\u00fcnther, F., Mehl, M., P\u00f6gl, M., Zenger, C.: A cache-aware algorithm for PDEs on hierarchical data structures based on space-filling curves. SIAM J. Sci. Comput. 28(5), 1634\u20131650 (2006) (electronic)","journal-title":"SIAM J. Sci. Comput."},{"key":"9306_CR9","first-page":"2433","volume":"123","author":"H. Hahn","year":"1914","unstructured":"Hahn, H.: Mengentheoretische characterisierung der stetigen kurven. Sitzungsber. Akad. Wiss. Wien Abt. IIa 123, 2433\u20132489 (1914)","journal-title":"Sitzungsber. Akad. Wiss. Wien Abt. IIa"},{"issue":"5","key":"9306_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ipl.2007.08.034","volume":"105","author":"C.H. Hamilton","year":"2008","unstructured":"Hamilton, C.H., Rau-Chaplin, A.: Compact Hilbert indices: space-filling curves for domains with unequal side lengths. Inform. Process. Lett. 105(5), 155\u2013163 (2008)","journal-title":"Inform. Process. Lett."},{"key":"9306_CR11","volume-title":"Topology","author":"J.G. Hocking","year":"1988","unstructured":"Hocking, J.G., Young, G.S.: Topology, 2nd edn. Dover, New York (1988)","edition":"2"},{"key":"9306_CR12","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.2140\/gt.2007.11.1315","volume":"11","author":"J. Cannon","year":"2007","unstructured":"Cannon, J., Thurston, W.: Group invariant Peano curves. Geom. Topol. 11, 1315\u20131355 (2007)","journal-title":"Geom. Topol."},{"issue":"5\u20136","key":"9306_CR13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.matcom.2006.12.009","volume":"75","author":"S. Makhanov","year":"2007","unstructured":"Makhanov, S.: Optimization and correction of the tool path of the five-axis milling machine. I. Spatial optimization. Math. Comput. Simul. 75(5\u20136), 210\u2013230 (2007)","journal-title":"Math. Comput. Simul."},{"key":"9306_CR14","doi-asserted-by":"crossref","first-page":"166","DOI":"10.4064\/fm-1-1-166-209","volume":"1","author":"S. Mazurkiewicz","year":"1920","unstructured":"Mazurkiewicz, S.: Sur les lignes de jordan. Fund. Math. 1, 166\u2013209 (1920)","journal-title":"Fund. Math."},{"key":"9306_CR15","series-title":"Electronic Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-45651-1","volume-title":"CCA 2002, Computability and Complexity in Analysis","author":"J. Miller","year":"2002","unstructured":"Miller, J.: Effectiveness for embedded spheres and balls. In: Brattka, V., Schr\u00f6der, M., Weihrauch, K. (eds.) CCA 2002, Computability and Complexity in Analysis. Electronic Notes in Computer Science, vol. 66, pp. 127\u2013138. Elsevier, Amsterdam (2002)"},{"issue":"2","key":"9306_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/S0002-9947-1916-1501033-7","volume":"17","author":"R.L. Moore","year":"1916","unstructured":"Moore, R.L.: On the foundations of plane analysis situs. Trans. Amer. Math. Soc. 17(2), 131\u2013164 (1916)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9306_CR17","volume-title":"Topology: A First Course","author":"J.R. Munkres","year":"1975","unstructured":"Munkres, J.R.: Topology: A First Course. Englewood Cliffs, Prentice-Hall (1975)"},{"key":"9306_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G. Peano","year":"1890","unstructured":"Peano, G.: Sur une courbe qui remplit toute une aire plane. Math. Ann. 36, 157\u2013160 (1890)","journal-title":"Math. Ann."},{"key":"9306_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-filling Curves. Universitext","author":"H. Sagan","year":"1994","unstructured":"Sagan, H.: Space-filling Curves. Universitext. Springer, New York (1994)"},{"issue":"2","key":"9306_CR20","first-page":"213","volume":"9","author":"P. S\u00e9\u00e9bold","year":"2007","unstructured":"S\u00e9\u00e9bold, P.: Tag-systems for the Hilbert curve. Discrete Math. Theor. Comput. Sci. 9(2), 213\u2013226 (2007) (electronic)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"9306_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10711-008-9253-1","volume":"135","author":"V.F. Sirvent","year":"2008","unstructured":"Sirvent, V.F.: Space filling curves and geodesic laminations. Geom. Dedicata 135, 1\u201314 (2008)","journal-title":"Geom. Dedicata"},{"key":"9306_CR22","volume-title":"Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9306-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9306-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9306-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T03:34:21Z","timestamp":1559878461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9306-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9306"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9306-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,16]]}}}