A method is presented for the computation of Schwarz--Christoffel maps to polygons with tens of thousands of vertices. Previously published algorithms have CPU time estimates of the order O(N3 ) for the computation of a conformal map of a polygon with N vertices. This has been reduced to O(N log N) by the use of the fast multipole method and Davis's method for solving the parameter problem. The method is illustrated by a number of examples, the largest of which has N ≈ 2 × 10⁵.
No takes yet. Share an insight, caveat, or question.
Banjai et al. (2003) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: