Curves that must be retraced

DOI10.1016/J.IC.2011.01.004MaRDI QIDQ550254zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo

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)

Recommendations

• Curves that must be retraced
• Points on Computable Curves of Computable Lengths
• On the computability of rectifiable simple curve. (Extended abstract)
• A polynomial-time computable curve whose interior has a nonrecursive measure
• Point-separable classes of simple computable planar curves

Cites work

• scientific article; zbMATH DE number 3788601 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 47345 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 705152 (Why is no real title available?)
• scientific article; zbMATH DE number 1994007 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• A polynomial-time computable curve whose interior has a nonrecursive measure
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Computability of Julia sets
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable functionals
• Computational complexity of real functions
• Computing over the reals: foundations for scientific computing.
• Jordan Areas and Grids
• Points on Computable Curves of Computable Lengths
• Topologies on Spaces of Subsets
• Topology in Lattices

Cited in

(9)

• Computing links and accessing arcs
• Computability of Subsets of Metric Spaces
• Curves that must be retraced
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• On the computability of rectifiable simple curve. (Extended abstract)
• Point-separable classes of simple computable planar curves
• Mutual dimension
• The power of backtracking and the confinement of length
• Points on Computable Curves of Computable Lengths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550254)