A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)

Details A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)

2010-06-02

arxiv.org/abs/1006.0402v1

EPTCS 24, 2010, pp. 120-129

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.24.16

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.

Affiliated with

Also associated with

No associations

Rating

A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512949