Computing space-filling curves

DOI10.1007/s00224-010-9306-3zbMath1280.03058OpenAlexW2077759711MaRDI QIDQ692924

P. J. Couch, B. D. Daniel, Timothy H. McNicholl

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9306-3

zbMATH Keywords

computable analysisspace-filling curvesPeano continuaconstructive analysislocally connected spaces

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65) Computation over the reals, computable analysis (03D78)

Related Items (10)

Carathéodory’s Theorem and moduli of local connectivity ⋮ Lines missing every random point1 ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ The power of backtracking and the confinement of length ⋮ Computing links and accessing arcs ⋮ Computing boundary extensions of conformal maps ⋮ Mutual Dimension ⋮ Computability of Subsets of Metric Spaces ⋮ Computable Complex Analysis ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Effective versions of local connectivity properties
• Controlled Hahn--Mazurkiewicz Theorem and some new dimension functions of Peano continua
• Space filling curves and geodesic laminations
• Space-filling curves
• Compact Hilbert indices: space-filling curves for domains with unequal side lengths
• Optimization and correction of the tool path of the five-axis milling machine. I: Spatial optimization
• Group invariant Peano curves
• Dimensions of the coordinate functions of space-filling curves
• A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves
• Plottable Real Number Functions and the Computable Graph Theorem
• Effectiveness for Embedded Spheres and Balls
• The priority R-tree

This page was built for publication: Computing space-filling curves