Curves that must be retraced

DOI10.1016/j.ic.2011.01.004zbMath1221.68271OpenAlexW2073415241WikidataQ60578961 ScholiaQ60578961MaRDI QIDQ550254

Elvira Mayordomo, Jack H. Lutz, Xiaoyang Gu

Publication date: 8 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2267/

zbMATH Keywords

computable parametrizations of curvespolynomial time computabilityretracingsimple rectifiable smooth plane curve

Mathematics Subject Classification ID

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

Related Items

The power of backtracking and the confinement of length ⋮ Computing links and accessing arcs ⋮ Mutual Dimension ⋮ Computability of Subsets of Metric Spaces ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• A polynomial-time computable curve whose interior has a nonrecursive measure
• Computational complexity of real functions
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Points on Computable Curves of Computable Lengths
• Computable functionals
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Jordan Areas and Grids
• Topologies on Spaces of Subsets
• Topology in Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Curves that must be retraced