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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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).
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.
Besl, P. J., McKay, N. D.: A method of registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14, 239–256 (1992).
Cignoni, P., Montani, C., Scopigno, R.: A comparison of mesh simplification algorithms. Comput. Graphics 22, 37–54 (1998).
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.
Hoffmann, F., Kriegel, K., Wenk, C.: Matching 2D patterns of proteins spots. In: Proc. 14th ACM Symposium on Computational Geometry, pp. 231–239 (1998).
Horn, B. K. P.: Closed-form solution of absolute orientation using unit quaternions. J. Optical Soc. Am. 4, 629–642 (1987).
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.
Ogawa, H.: Labeled point pattern matching by Delaunay triangulations and maximal cliques. Pattern Rec. 19, 35–40 (1986).
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.
Taubin, G.: A signal processing approach to fair surface design. In: Proceedings SIGGRAPH’95, pp. 351–358 (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this paper
Cite this paper
Fröhlich, M., Müller, H., Pillokat, C., Weller, F. (2001). Feature-Based Matching of Triangular Meshes. In: Brunnett, G., Bieri, H., Farin, G. (eds) Geometric Modelling. Computing, vol 14. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6270-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6270-5_7
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83603-3
Online ISBN: 978-3-7091-6270-5
eBook Packages: Springer Book Archive