A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for Schwarz-Christoffel mappings and, more generally, Riemann mappings of domains...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2010-06-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1006.0402v1 |
| id |
doaj-4b1b4c6afa4641b78ec39fa5f2bd0da4 |
|---|---|
| record_format |
Article |
| spelling |
doaj-4b1b4c6afa4641b78ec39fa5f2bd0da42020-11-24T20:57:03ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-06-0124Proc. CCA 201012012910.4204/EPTCS.24.16A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)Robert RettingerWe show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for Schwarz-Christoffel mappings and, more generally, Riemann mappings of domains with piecewise analytic boundaries. http://arxiv.org/pdf/1006.0402v1 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Robert Rettinger |
| spellingShingle |
Robert Rettinger A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) Electronic Proceedings in Theoretical Computer Science |
| author_facet |
Robert Rettinger |
| author_sort |
Robert Rettinger |
| title |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
| title_short |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
| title_full |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
| title_fullStr |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
| title_full_unstemmed |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
| title_sort |
local to global principle for the complexity of riemann mappings (extended abstract) |
| publisher |
Open Publishing Association |
| series |
Electronic Proceedings in Theoretical Computer Science |
| issn |
2075-2180 |
| publishDate |
2010-06-01 |
| description |
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for Schwarz-Christoffel mappings and, more generally, Riemann mappings of domains with piecewise analytic boundaries. |
| url |
http://arxiv.org/pdf/1006.0402v1 |
| work_keys_str_mv |
AT robertrettinger alocaltoglobalprincipleforthecomplexityofriemannmappingsextendedabstract AT robertrettinger localtoglobalprincipleforthecomplexityofriemannmappingsextendedabstract |
| _version_ |
1716788874102964224 |