Abstract
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 \approx 2 \times 10^5$.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
