A fast algorithm for kinematic chain isomorphism identification based on dividing and matching vertices

Kinematic chain isomorphism identification is a crucial issue in mechanism topology and an important application of Graph Isomorphism to mechanisms. In this paper, a kinematic chain is uniquely represented by a graph, and a fast deterministic algorithm called the Dividing and Matching Algorithm (DMA...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mechanism and machine theory 2014-02, Vol.72, p.25-38
Hauptverfasser: Zeng, Kehan, Fan, Xiaogui, Dong, Mingchui, Yang, Ping
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!