eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2009-11-25
221
232
10.4230/OASIcs.CCA.2009.2273
article
On the Computability of Rectifiable Simple Curve (Extended Abstract)
Rettinger, Robert
Zheng, Xizhong
In mathematics curves are defined as the images of continuous real functions defined on closed intervals and these continuous functions are called parameterizations of the corresponding curves. If only simple curves of finite lengths are considered, then parameterizations can be restricted to the injective continuous functions or even to the continuous length-normalized parameterizations. In addition, a plane curve can also be considered as a connected one-dimensional compact subset of points. By corresponding effectivizations, we will introduce in this paper four versions of computable curves and show that they are all different. More interestingly, we show also that four classes of computable curves cover even different sets of points.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol011-cca2009/OASIcs.CCA.2009.2273/OASIcs.CCA.2009.2273.pdf
Computable curve
simple curve
rectifiable curve
point separability