Fast computation of the circular map
Mohamed M. S. Nasser · 2016
This paper presents a new numerical implementation of Koebe's iterative method for computing the circular map of bounded and unbounded multiply connected regions of connectivity $$m$$ . The computational cost of the presented method is $$O(m^2n+mn\log n)$$ where $$n$$ is the number of nodes in the discretization of each boundary component. The accuracy and efficiency of the method presented are demonstrated by several numerical examples. These examples include regions with high connectivity, a region with close-to-touching boundaries, and a region with piecewise smooth boundaries.