Point-separable classes of simple computable planar curves
From MaRDI portal
Abstract: In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of finite lengths, parametrizations can be further required to be injective or even length-normalized. All of these four approaches to curves are classically equivalent. In this paper we investigate four different versions of computable curves based on these four approaches. It turns out that they are all different, and hence, we get four different classes of computable curves. More interestingly, these four classes are even point-separable in the sense that the sets of points covered by computable curves of different versions are also different. However, if we consider only computable curves of computable lengths, then all four versions of computable curves become equivalent. This shows that the definition of computable curves is robust, at least for those of computable lengths. In addition, we show that the class of computable curves of computable lengths is point-separable from the other four classes of computable curves.
Recommendations
Cited in
(8)- On the complexity of computing the Hausdorff distance
- On the computability of rectifiable simple curve. (Extended abstract)
- Points on Computable Curves of Computable Lengths
- Lines missing every random point
- The power of backtracking and the confinement of length
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Curves that must be retraced
- A polynomial-time computable curve whose interior has a nonrecursive measure
This page was built for publication: Point-separable classes of simple computable planar curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914236)
