2013/07/24 by Valentin V. Andreev, Andreev, Valentin V., Dale Daniel +3
Computer Science · Mathematics · #Complex Variables (math.CV) #Computability, Logic, AI Algorithms #Computer science #Conformal map #FOS: Mathematics #Geometric and Algebraic Topology #Geometry #Mathematics #math.CV #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1307.6535
arxiv created 2013/07/24 · openalex publication_date 2013/07/24 · arxiv updated 2013/07/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that, given a non-degenerate, finitely connected domain D, its boundary, and the number of its boundary components, it is possible to compute a conformal mapping of D onto a circular domain without prior knowledge of the circular domain. We do so by computing a suitable bound on the error in the Koebe construction (but, again, without knowing the circular domain in advance). As a scientifically sound model of computation with continuous data, we use Type-Two Effectivity.