Möbius-invariant natural neighbor interpolation

ABSTRACT

We propose an interpolation method invariant under Möbius transformations: interpolation followed by transformation gives the same result as transformation followed by interpolation. The method uses natural (Delaunay) neighbors, but weights neighbors according to angles formed by Delaunay circles.

REFERENCES

• 1: Marshall W. Bern , David Eppstein, Optimal Möbius Transformations for Information Visualization and Meshing, Proceedings of the 7th International Workshop on Algorithms and Data Structures, p.14-25, August 08-10, 2001
• 2: M.K. Hurdal, P.L. Bowers, K. Stephenson, D.W.L. Summers, K. Rehm, K. Shaper, and D.A. Rottenberg. Quasi-conformally flat mapping the human cerebellum, http://www.math.fsu.edu/~aluffi/archive/paper98.ps.gz
• 3: B. Iversen. Hyperbolic Geometry. London Math. Soc. Student Texts 25. Cambridge Univ. Press, 1992.
• 4: John Lamping , Ramana Rao , Peter Pirolli, A focus+context technique based on hyperbolic geometry for visualizing large hierarchies, Proceedings of the SIGCHI conference on Human factors in computing systems, p.401-408, May 07-11, 1995, Denver, Colorado, United States [doi>10.1145/223904.223956]
• 5: Tamara Munzner, Exploring Large Graphs in 3D Hyperbolic Space, IEEE Computer Graphics and Applications, v.18 n.4, p.18-23, July 1998 [doi>10.1109/38.689657]
• 6: C. Pommerenke. Boundary Behaviour of Conformal Maps. Springer-Verlag, 1992.
• 7: R. Sibson. A brief description of natural neighbour interpolation. In Interpreting Multivariate Data, V. Barnett, ed., Wiley, 1981, 21--36.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.1 Interpolation

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Pattern matching

General Terms:
Algorithms, Theory