Journal article 526 views
On the computability of the set of automorphisms of the unit square
Eike Neumann
Theoretical Computer Science, Volume: 903, Pages: 74 - 83
Swansea University Author: Eike Neumann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1016/j.tcs.2021.12.019
Abstract
We show that the closure of the set of orientation-preserving automorphisms of the unit square is computable in the bit-model of real computation. As an application we obtain a conditional result on the computability of the Fréchet-distance of continuous surfaces.
Published in: | Theoretical Computer Science |
---|---|
ISSN: | 0304-3975 |
Published: |
Elsevier BV
2022
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa60148 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2022-06-07T14:07:36Z |
---|---|
last_indexed |
2023-01-11T14:41:55Z |
id |
cronfa60148 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2022-07-07T10:39:09.1119748</datestamp><bib-version>v2</bib-version><id>60148</id><entry>2022-06-07</entry><title>On the computability of the set of automorphisms of the unit square</title><swanseaauthors><author><sid>1bf535eaa8d6fcdfbd464a511c1c0c78</sid><firstname>Eike</firstname><surname>Neumann</surname><name>Eike Neumann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2022-06-07</date><deptcode>SCS</deptcode><abstract>We show that the closure of the set of orientation-preserving automorphisms of the unit square is computable in the bit-model of real computation. As an application we obtain a conditional result on the computability of the Fréchet-distance of continuous surfaces.</abstract><type>Journal Article</type><journal>Theoretical Computer Science</journal><volume>903</volume><journalNumber/><paginationStart>74</paginationStart><paginationEnd>83</paginationEnd><publisher>Elsevier BV</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0304-3975</issnPrint><issnElectronic/><keywords>Real computation, Computable analysis, Automorphisms, Computational geometry, Fréchet distance</keywords><publishedDay>8</publishedDay><publishedMonth>2</publishedMonth><publishedYear>2022</publishedYear><publishedDate>2022-02-08</publishedDate><doi>10.1016/j.tcs.2021.12.019</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2022-07-07T10:39:09.1119748</lastEdited><Created>2022-06-07T15:05:07.0316170</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Eike</firstname><surname>Neumann</surname><order>1</order></author></authors><documents/><OutputDurs/></rfc1807> |
spelling |
2022-07-07T10:39:09.1119748 v2 60148 2022-06-07 On the computability of the set of automorphisms of the unit square 1bf535eaa8d6fcdfbd464a511c1c0c78 Eike Neumann Eike Neumann true false 2022-06-07 SCS We show that the closure of the set of orientation-preserving automorphisms of the unit square is computable in the bit-model of real computation. As an application we obtain a conditional result on the computability of the Fréchet-distance of continuous surfaces. Journal Article Theoretical Computer Science 903 74 83 Elsevier BV 0304-3975 Real computation, Computable analysis, Automorphisms, Computational geometry, Fréchet distance 8 2 2022 2022-02-08 10.1016/j.tcs.2021.12.019 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-07-07T10:39:09.1119748 2022-06-07T15:05:07.0316170 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Eike Neumann 1 |
title |
On the computability of the set of automorphisms of the unit square |
spellingShingle |
On the computability of the set of automorphisms of the unit square Eike Neumann |
title_short |
On the computability of the set of automorphisms of the unit square |
title_full |
On the computability of the set of automorphisms of the unit square |
title_fullStr |
On the computability of the set of automorphisms of the unit square |
title_full_unstemmed |
On the computability of the set of automorphisms of the unit square |
title_sort |
On the computability of the set of automorphisms of the unit square |
author_id_str_mv |
1bf535eaa8d6fcdfbd464a511c1c0c78 |
author_id_fullname_str_mv |
1bf535eaa8d6fcdfbd464a511c1c0c78_***_Eike Neumann |
author |
Eike Neumann |
author2 |
Eike Neumann |
format |
Journal article |
container_title |
Theoretical Computer Science |
container_volume |
903 |
container_start_page |
74 |
publishDate |
2022 |
institution |
Swansea University |
issn |
0304-3975 |
doi_str_mv |
10.1016/j.tcs.2021.12.019 |
publisher |
Elsevier BV |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
document_store_str |
0 |
active_str |
0 |
description |
We show that the closure of the set of orientation-preserving automorphisms of the unit square is computable in the bit-model of real computation. As an application we obtain a conditional result on the computability of the Fréchet-distance of continuous surfaces. |
published_date |
2022-02-08T04:18:01Z |
_version_ |
1763754200371560448 |
score |
11.016235 |