Approximate topological matching of quadrilateral meshes

We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes. This study is motivated by applications in graphics that involve shape modeling whose results need to be merged in order to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2008 IEEE International Conference on Shape Modeling and Applications S. 83 - 92
Hauptverfasser: Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2008
Schlagworte:
Animation
Biological system modeling
Computer graphics
F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-Geometrical problems and computations
Finite element methods
Greedy algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Boundary representations
Performance analysis
Polynomials
Shape
Simultaneous localization and mapping
Software systems
ISBN:9781424422609, 1424422604
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes. This study is motivated by applications in graphics that involve shape modeling whose results need to be merged in order to produce a final unified representation of an object. We show that the problem of producing a maximum approximate topological match of two quad meshes in NP-hard. Given this result, which makes an exact solution extremely unlikely, we show that the natural greedy algorithm derived from polynomial-time graph isomorphism can produce poor results, even when it is possible to find matches with only a few non-matching quads. Nevertheless, we provide a "lazy-greedy" algorithm that is guaranteed to find good matches when mis-matching portions of mesh are localized. Finally, we provide empirical evidence that this approach produces good matches between similar quad meshes.
ISBN:9781424422609
1424422604
DOI:10.1109/SMI.2008.4547954