期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2010
卷号：24
页码：120-129
DOI：10.4204/EPTCS.24.16
出版社：Open Publishing Association
摘要：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.
