'기반지식/알고리즘'에 해당되는 글 2건

  1. 2011.01.11 폴리곤 왜곡 #2
  2. 2011.01.11 폴리곤 왜곡 #1
기반지식/알고리즘2011. 1. 11. 14:51

Schwarz–Christoffel mapping

From Wikipedia, the free encyclopedia
  (Redirected from Schwarz-Christoffel mapping)

In complex analysis, a Schwarz–Christoffel mapping is a conformal transformation of the upper half-plane onto the interior of a simple polygon. Schwarz–Christoffel mappings are used in potential theory and some of its applications, including minimal surfaces and fluid dynamics. They are named after Elwin Bruno Christoffel andHermann Amandus Schwarz.

Contents

 [hide]

[edit]Definition

Consider a polygon in the complex plane. The Riemann mapping theorem implies that there is a bijective biholomorphic mapping f from the upper half-plane

 \{ \zeta \in \mathbb{C}: \operatorname{Im}\,\zeta > 0 \}

to the interior of the polygon. The function f maps the real axis to the edges of the polygon. If the polygon has interior angles \alpha,\beta,\gamma, \ldots, then this mapping is given by


f(\zeta) = \int^\zeta \frac{K}{(w-a)^{1-(\alpha/\pi)}(w-b)^{1-(\beta/\pi)}(w-c)^{1-(\gamma/\pi)} \cdots} \,\mbox{d}w

where K is a constant, and a < b < c < ... are the values, along the real axis of the ζ plane, of points corresponding to the vertices of the polygon in the z plane. A transformation of this form is called a Schwarz–Christoffel mapping.

It is often convenient to consider the case in which the point at infinity of the ζ plane maps to one of the vertices of the z plane polygon (conventionally the vertex with angle α). If this is done, the first factor in the formula is effectively a constant and may be regarded as being absorbed into the constant K.

[edit]Example

Consider a semi-infinite strip in the z plane. This may be regarded as a limiting form of a triangle with vertices P = 0Q = π i, and R (with R real), as R tends to infinity. Now α = 0 and β = γ = π2 in the limit. Suppose we are looking for the mapping f with f(−1) = Qf(1) = P, and f(∞) = R. Then f is given by

 f(\zeta) = \int^\zeta 
  \frac{K}{(w-1)^{1/2}(w+1)^{1/2}} \,\mbox{d}w. \,

Evaluation of this integral yields

z> = f(ζ) = C + K ar cosh ζ

where C is a (complex) constant of integration. Requiring that f(−1) = Q and f(1) = P gives C = 0 and K = 1. Hence the Schwarz–Christoffel mapping is given by

z = ar cosh ζ

This transformation is sketched below.

Schwarz–Christoffel mapping of the upper half-plane to the semi-infinite strip

[edit]
Other simple mappings

[edit]Triangle

A mapping to a plane triangle with angles \pi a,\, \pi b and π(1 − a − b) is given by

z=f(\zeta)=\int^\zeta \frac{dw}{(w-1)^{1-a} (w+1)^{1-b}}.

[edit]Square

The upper half-plane is mapped to the square by

z=f(\zeta) = \int^\zeta \frac {\mbox{d}w}{\sqrt{w(w^2-1)}}
=\sqrt{2} \, F\left(\sqrt{\zeta+1};\sqrt{2}/2\right).

where F is the incomplete elliptic integral of the first kind.

[edit]General triangle

The upper half-plane is mapped to a triangle with circular arcs for edges by the Schwarz triangle map.

[edit]See also

[edit]References

[edit]Further reading

[edit]External links

'기반지식 > 알고리즘' 카테고리의 다른 글

폴리곤 왜곡 #1  (0) 2011.01.11
Posted by windship
기반지식/알고리즘2011. 1. 11. 14:50

Complex Barycentric Coordinates with Applications to Planar Shape Deformation


Ofir Weber       Mirela Ben-Chen       Craig Gotsman

 


Eurographics 2009 - Computer Graphics Forum 28, 2 (2009)
Gunter Enderle Best Paper Award

 

Image deformation using Point-to-Point complex barycentric coordinates.
Click on the image for hi-res version

 

 
Abstract:
Barycentric coordinates are heavily used in computer graphics applications to generalize a set of given data values. Traditionally, the coordinates are required to satisfy a number of key properties, the first being that they are real and positive. In this paper we relax this requirement, allowing the barycentric coordinates to be complex numbers. This allows us to generate new families of barycentric coordinates, which have some powerful advantages over traditional ones. Applying complex barycentric coordinates to data which is itself complex-valued allows to manipulate functions from the complex plane to itself, which may be interpreted as planar mappings. These mappings are useful in shape and image deformation applications. We use Cauchy뭩 theorem from complex analysis to construct complex barycentric coordinates on (not necessarily convex) polygons, which are shown to be equivalent to planar Green coordinates. These generate conformal mappings from a given source region to a given target region, such that the image of the source region is close to the target region. We then show how to improve the Green coordinates in two ways. The first provides a much better fit to the polygonal target region, and the second allows to generate deformations based on positional constraints, which provide a more intuitive user interface than the conventional cage-based approach. These define two new types of complex barycentric coordinates, which are shown to be very effective in interactive deformation and animation scenarios.
 
Paper - PDF:
      
Supplementary Material - PDF:
      
Video - QuickTime (H264):
      
BibTeX entry:
@article{Complex_Coordinates:2009,
author = {Ofir Weber and Mirela Ben-Chen and Craig Gotsman},
title = {Complex Barycentric Coordinates with Applications to Planar Shape Deformation},
journal = {Computer Graphics Forum (Proceedings of Eurographics)},
volume = {28},
number = {2},
year = {2009},
}
 

More examples:

Comparison of the Point-to-Point Cauchy-Green complex barycentric coordinates and the MLS similarity coordinates.
(left to right) Original image; Deformation using Point-to-Point coordinates; Deformation using MLS coordinates.
The Point-to-Point coordinates better handle control points whose Euclidean distance is small, yet their geodesic distance within the cage is large.
Click on the image for hi-res version

 
 
 
 
 

Deformation of a bird using Szego coordinates. The cage has 21 vertices.
Click on the image for hi-res version

 
 
 
 
 

A giraffe (left), and its deformation (right) using Point-to-point Cauchy-Green coordinates, with 16 control points. The cage has 113 vertices.
Click on the image for hi-res version

Color-coded visualization of one P2P coordinate function. (left to right) Real part; Imaginary part; Absolute value.
Click on the image for hi-res version

 
 
 
 
 

'기반지식 > 알고리즘' 카테고리의 다른 글

폴리곤 왜곡 #2  (0) 2011.01.11
Posted by windship