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.
@InProceedings{rettinger_et_al:OASIcs.CCA.2009.2273, author = {Rettinger, Robert and Zheng, Xizhong}, title = {{On the Computability of Rectifiable Simple Curve}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {221--232}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2273}, URN = {urn:nbn:de:0030-drops-22736}, doi = {10.4230/OASIcs.CCA.2009.2273}, annote = {Keywords: Computable curve, simple curve, rectifiable curve, point separability} }
Feedback for Dagstuhl Publishing