On the conformal mapping of a circular disc with a curvilinear polygonal hole

A method of finding a mapping function which maps the doubly-connected region between a circle and a curvilinear polygon onto an annulus is described and numerical results for the ratio of the radii of the annulus given.     

Analysis and design of polygonal resistors by conformal mapping

To compute the electrical resistance ( conformal modulus) of a polygonally shaped resistor cut from a sheet of uniform resistivity, it suffices to find a conformal map of the polygon onto a rectangle. Constructing such a map requires the solution of a Schwarz-Christoffel parameter problem. First we show by examples that this is practical numerically. Then we consider an inverse resistor trimming problem in which the aim is to cut a slit in a given polygon just long enough to increase its resistance to a prescribed value. We show that here the solution can be obtained by solving a generalized parameter problem. The idea of a generalized parameter problem is applicable also in many other Schwarz-Christoffel computations.

---

Zusammenfassung Um den elektrischen Widerstand eines polygonalen Resistors aus einem Material homogener Leitfähigkeit zu berechnen, genügt es, eine konforme Abbildung des Polygons auf ein Rechteck zu finden. Die Konstruktion einer solchen Abbildung erfordert die Lösung eines Schwarz-Christof-felschen Parameterproblems. Wir zeigen zunächst anhand von Beispielen, daß dies numerisch durchführbar ist. Dann betrachten wir ein inverses Problem: Die Aufgabe besteht hier darin, einen Schlitz in ein gegebenes Polygon zu schneiden, dessen Länge gerade so gewählt ist, daß der Widerstand auf einen vorgegebenen Wert erhöht wird. Wir zeigen, daß dieses Problem auf ein verallgemeinertes Parameterproblem zurückgeführt werden kann. Die Idee des verallgemeinerten Parameterproblems ist auch auf viele weitere Schwarz-Christoffel-Probleme anwendbar.

---

---

Supported by NSF Mathematical Sciences Postdoctoral Fellowship, and by the U.S. Dept. of Energy under contract DE-AC02-76-ER03077-V. This work was performed at the Courant Institute of Mathematical Sciences, New York University.     

On conformal moduli of polygonal quadrilaterals

The change of conformal moduli of polygonal quadrilaterals under some geometric transformations is studied. We consider the motion of one vertex when the other vertices remain fixed, the rotation of sides, polarization, symmetrization, and averaging transformation of the quadrilaterals. Some open problems are formulated.     

Time-dependent conformal mapping of doubly-connected regions

This paper examines two key features of time-dependent conformal mappings in doubly-connected regions, the evolution of the conformal modulus Q(t) and the boundary transformation generalizing the Hilbert transform. It also applies the theory to an unsteady free surface flow. Focusing on inviscid, incompressible, irrotational fluid sloshing in a rectangular vessel, it is shown that the explicit calculation of the conformal modulus is essential to correctly predict features of the flow. Results are also presented for fully dynamic simulations which use a time-dependent conformal mapping and the Garrick generalization of the Hilbert transform to map the physical domain to a time-dependent rectangle in the computational domain. The results of this new approach are compared to the complementary numerical scheme of Frandsen (J. Comput. Phys. 196:53–87, 14) and it is shown that correct calculation of the conformal modulus is essential in order to obtain agreement between the two methods.     

Fast conformal mapping of multiply connected regions

An iterative method is presented which constructs for an unbounded region G with m holes and sufficiently smooth boundary a circular region H and a conformal mapping Φ from H to G. With the usual normalization both H and Φ are uniquely determined by G. With a few modifications the method can also be applied to a bounded region G with m holes. The canonical region H is then the unit disc with m circular holes. The proposed method also determines the centers and radii of the boundary circles of H and requires, at each iterative step, the solution of a Riemann–Hilbert (RH) problem, which has a unique solution. Numerically, the RH problem can be treated efficiently by the method of successive conjugation using the fast Fourier transform (FFT). The iteration for the solution of the RH problem converges linearly. The conformal mapping method converges quadratically. The results of some test calculations exemplify the performance of the method.     

Osculation methods for the conformal mapping of doubly connected regions

An osculation method for the conformal mapping of a doubly connected region onto an annulus and corresponding numerical experiments are described. The experiments indicate that even difficult mapping problems are solved very efficiently and at low cost.

---

Zusammenfassung Für die konforme Abbildung eines zweifach zusammenhängenden Gebiets auf einen Kreisring wird ein Schmiegungsverfahren beschrieben. Die dazu durchgeführten numerischen Experimente ergeben gute Resultate mit geringen Kosten selbst bei komplizierten Abbildungsproblemen.

     

Numerical conformal mapping of multiply connected regions by Fornberg-like methods

Summary. We develop a new algorithm for computing conformal maps from regions exterior to non-overlapping disks to unbounded multiply connected regions exterior to non-overlapping, smoothly bounded Jordan regions. The method is an extension of Fornberg's original Newton-like method for mapping of the disk to simply connected regions. A Fortran program based on the algorithm has been developed and tested for the 2 and 3 disk case. Numerical examples are reported. Received March 12, 1998 / Revised version received December 16, 1998     

On conformal mapping and linear measure

Journal d'Analyse Mathématique -     

Numerical conformal mapping of multiply connected domains to regions with circular boundaries

We propose a method to map a multiply connected bounded planar region conformally to a bounded region with circular boundaries. The norm of the derivative of such a conformal map satisfies the Laplace equation with a nonlinear Neumann type boundary condition. We analyze the singular behavior at corners of the boundary and separate the major singular part. The remaining smooth part solves a variational problem which is easy to discretize. We use a finite element method and a gradient descent method to find an approximate solution. The conformal map is then constructed from this norm function. We tested our algorithm on a polygonal region and a curvilinear smooth region.     

On the approximate conformal mapping of multiply connected domains

Summary A method is presented for constructing approximations to the standard mappings for multiply connected regions given by Nehari [5]. The case of mapping onto a slit annulus is considered in detail, and computational results are presented for several examples.     

Interactive texture mapping for polygonal models

Polygonal models have been widely applied in the community of CAD and computer graphics. Since a polygonal surface usually has no intrinsic parameterization, it is very difficult to map textures onto it with low distortion. In this paper, we present an efficient texture mapping algorithm for polygonal models. For each region to be mapped, the algorithm first constructs a B-spline patch with similar shape to surround the model. The mapped region is then projected onto the constructed B-spline patch to achieve a parameterization. By interactively controlling the B-spline patch, the user can conveniently decorate the surface of the model to meet his requirements. Both local and global texture mapping are discussed. The experimental results demonstrate that the algorithm has a great of potential applications in computer animation and virtual reality systems.     

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

Let ₁,..., _m bem simple Jordan curves in the plane, and letK ₁,...,K _m be their respective interior regions. It is shown that if each pair of curves _i , _j ,i j, intersect one another in at most two points, then the boundary ofK= _i ^=1m K _i contains at most max(2,6m – 12) intersection points of the curves ₁, and this bound cannot be improved. As a corollary, we obtain a similar upper bound for the number of points of local nonconvexity in the union ofm Minkowski sums of planar convex sets. Following a basic approach suggested by Lozano Perez and Wesley, this can be applied to planning a collision-free translational motion of a convex polygonB amidst several (convex) polygonal obstaclesA ₁,...,A _m . Assuming that the number of corners ofB is fixed, the algorithm presented here runs in timeO (n log² n), wheren is the total number of corners of theA _i 's.Work on this paper by the second author has been supported in part by a grant from the Bat-Sheva Fund at Israel. Work by the fourth author has been supported in part by a grant from the U.S.-Israeli Binational Science Foundation.