Non-uniform Geometric Matchings

  • Christian Knauer
  • Klaus Kriegel
  • Fabian Stehn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6784)


In this paper we introduce a generalization of the well studied class of geometric matching problems. The input to a geometric matching problem is usually two geometric objects P, Q drawn from a class of geometric objects \(\mathcal{G}\), a transformation class \(\mathcal{T}\) applicable to \(\mathcal{G}\) and a distance measure \(\operatorname{dist}_\mathcal{G}:\mathcal{G}\times\mathcal{G}\rightarrow\mathbb{R}^+\). The task is to compute the transformations \(t\in\mathcal{T}\) minimizing \(\operatorname{dist}_\mathcal{G}(t(P),Q)\).

Here, we extend this concept to non-uniform geometric matching problems. In this setting, a partition of P into k pieces P 1,…,P k is given and the task is to compute a sequence of transformations t 1,…,t k such that \(\operatorname{dist}_\mathcal{G}(\bigcup_i t_i(P_i), Q)\) is minimized. But instead of solving k usual geometric matching problems independently and taking the maximum of the computed distances, the objective function of a non-uniform geometric matching problem also requires the computed transformations to be similar with respect to a suitable similarity measure on \(\mathcal{T}\).

Computing a set of similar transformations to match an object P to Q allows to lower the influence of measurement errors and to model local deformations and has various applications, for example in medical navigation systems.

We present constant factor approximations and approximation schemes for point sequences under translations and constant factor approximations for point sets under translations.


Convex Polygon Small Disc Neighborhood Graph Pattern Space Point Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Maintz, J.B.A., Viergever, M.A.: A Survey of Medical Image Registration. Medical Image Analysis 2(1), 1–36 (1998)CrossRefGoogle Scholar
  2. 2.
    Maurer Jr., C.R., Fitzpatrick, J.M.: A Review of Medical Image Registration. Interactive Image Guided Neurosurgery, 17–44 (1993)Google Scholar
  3. 3.
    van den Elsen, P.A., Pol, E.J.D., Viergever, M.A.: Medical Image Matching – a Review with Classification. Engineering in Medicine and Biology Magazine, IEEE 12(1), 26–39 (1993)CrossRefGoogle Scholar
  4. 4.
    Dawant, B.M.: Non-Rigid Registration of Medical Images: Purpose and Methods, a Short Survey. In: Proceedings of the 2002 IEEE International Symposium on Biomedical Imaging, June 2002, pp. 465–468. IEEE, Washington, DC, USA (2002)Google Scholar
  5. 5.
    Alt, H., Guibas, L.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation. In: Handbook of Computational Geometry, pp. 121–153. Elsevier B.V, Amsterdam (2000)CrossRefGoogle Scholar
  6. 6.
    Knauer, C., Kriegel, K., Stehn, F.: Towards Non-Uniform Geometric Matchings. In: Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), Dortmund, Germany, pp. 257–260 (2010)Google Scholar
  7. 7.
    Boyd, S., Vandenberghe, L.: Convex Optimization, March 2004. Cambridge University Press, Cambridge (2004)CrossRefzbMATHGoogle Scholar
  8. 8.
    Huttenlocher, D.P., Kedem, K., Sharir, M.: The Upper Envelope of Voronoi Surfaces and its Applications. In: SCG 1991: Proceedings of the Seventh Annual Symposium on Computational Geometry, pp. 194–203. ACM Press, New York (1991)CrossRefGoogle Scholar
  9. 9.
    Megiddo, N.: On the Ball Spanned by Balls. Discrete & Computational Geometry 4, 605–610 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Rote, G.: The Convergence Rate of the Sandwich Algorithm for Approximating Convex Functions. Computing 48(3-4), 337–361 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Toussaint, G.T.: A Simple Linear Algorithm for Intersecting Convex Polygons. The Visual Computer 1, 118–123 (1985)CrossRefzbMATHGoogle Scholar
  12. 12.
    Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and their Geometric Applications. Cambridge University Press, New York (1996)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Christian Knauer
    • 1
  • Klaus Kriegel
    • 2
  • Fabian Stehn
    • 1
  1. 1.Institut für Angewandte InformatikUniversität BayreuthGermany
  2. 2.Institut für InformatikFreie Universität BerlinGermany

Personalised recommendations