Advertisement

Feature-Based Matching of Triangular Meshes

  • M. Fröhlich
  • H. Müller
  • C. Pillokat
  • F. Weller
Conference paper
Part of the Computing book series (COMPUTING, volume 14)

Abstract

Given two triangular surface meshes M and N in space and an error criterion, we want to find a rigid motion A so that the deviation of A(M) from N minimizes the error criterion. We present a solution to this problem for the case that the surface represented by M is known to be part of the surface represented by N. The solution consists of two steps: coarse matching and refined matching. Coarse matching is performed by first selecting a limited number of mesh vertices with special properties for which suitable numerical feature values are defined. From the selected characteristic vertices, labeled by their feature values, well-matching triples of vertices are selected which are additionally filtered by checking for whether they define an acceptable matching of the given meshes. For refined matching the iterated closest point approach is used which is speeded up by using an “nearest-neighbor-octree” for search space reduction. The solution aims at meshes with a high number of vertices.

Keywords

Feature Vector Triangular Mesh Subdivision Strategy Iterate Close Point Rigid Motion 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Allgower, E. L., Schmidt, P. H.: An algorithm for piecewise linear approximation of an implicitly defined manifold. SIAM J. Numer. Anal. 22, 322–346 (1985).MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Alt, H., Guibas, L.: Discrete geometric shapes: matching, interpolation, and approximation. In: Handbook of computational geometry (Urrutia, J., Sack, J.-R., eds.) Amsterdam: North-Holland.Google Scholar
  3. [3]
    Besl, P. J., McKay, N. D.: A method of registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14, 239–256 (1992).CrossRefGoogle Scholar
  4. [4]
    Cignoni, P., Montani, C., Scopigno, R.: A comparison of mesh simplification algorithms. Comput. Graphics 22, 37–54 (1998).CrossRefGoogle Scholar
  5. [5]
    Eberly, D.: Magic — may alternate graphics and image code. Department of Computer Science, University of North Carolina at Chapel Hill, ftp://ftp.cs.unc.edu/pub/packages/magic, 1998.
  6. [6]
    Hoffmann, F., Kriegel, K., Wenk, C.: Matching 2D patterns of proteins spots. In: Proc. 14th ACM Symposium on Computational Geometry, pp. 231–239 (1998).Google Scholar
  7. [7]
    Horn, B. K. P.: Closed-form solution of absolute orientation using unit quaternions. J. Optical Soc. Am. 4, 629–642 (1987).Google Scholar
  8. [8]
    Krsek, P., Lucks, G., Martin, R. R.: Algorithms for computing curvature from range data. In: The Mathematics of Surfaces VIII (Cripps, R., ed.), pp. 1–16. Winchester: Information Geometers. 1998.Google Scholar
  9. [9]
    Ogawa, H.: Labeled point pattern matching by Delaunay triangulations and maximal cliques. Pattern Rec. 19, 35–40 (1986).CrossRefGoogle Scholar
  10. [10]
    Press, W. H., Teukoldy, S. A., Vetterling, W. T., Flannery, B. P.: Numerical recipes in C — the state of scientific computing, 2nd edn. Cambridge: CUP, 1992.Google Scholar
  11. [11]
    Taubin, G.: A signal processing approach to fair surface design. In: Proceedings SIGGRAPH’95, pp. 351–358 (1995).Google Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • M. Fröhlich
    • 1
  • H. Müller
    • 1
  • C. Pillokat
    • 1
  • F. Weller
    • 1
  1. 1.Informatik VIIUniversität DortmundDortmundGermany

Personalised recommendations