A Fast Qc-mapping Theorem for Polygons

نویسنده

  • CHRISTOPHER J. BISHOP
چکیده

Given a simple n-gon P in the plane, normalized to contain the unit disk, we define a map from P to the unit circle so that (1) the map extends to be 8-quasiconformal on the interior, (2) it contracts arclength on the boundary and (3) the images of all n vertices can be computed in time O(n). Thus we obtain a fast K-QC-approximation to the Riemann map with constant K independent of the domain. Date: March 2, 2007. 1991 Mathematics Subject Classification. Primary: 30C35, Secondary: 30C85, 30C62 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Mapping Theorem for Polygons

Given a simple n-gon P in the plane, normalized to contain the unit disk, we define a map from P to the unit circle so that (1) the map extends to be 8-quasiconformal on the interior, (2) it contracts arclength on the boundary and (3) the images of all n vertices can be computed in time O(n). Thus we obtain a fast QC-approximation to the Riemann map with constant independent of the domain. Date...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

Fixed point theorem for non-self mappings and its applications in the modular ‎space

‎In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007