Robert Rettinger |
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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.24.16 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |