Points on Computable Curves of Computable Lengths

DOI10.1007/978-3-642-03816-7_62zbMath1247.03102OpenAlexW7536951MaRDI QIDQ3182970

Robert Rettinger, Zheng, Xizhong

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_62

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computation over the reals, computable analysis (03D78)

Related Items (3)

Curves that must be retraced ⋮ Mutual Dimension ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• A polynomial-time computable curve whose interior has a nonrecursive measure
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Curves That Must Be Retraced
• Computability theory of generalized functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Points on Computable Curves of Computable Lengths