Computing braid groups of graphs with applications to robot motion planning
From MaRDI portal
Kinematics of mechanisms and robots (70B15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Braid groups; Artin groups (20F36) Fundamental group, presentations, free differential calculus (57M05) Control of mechanical systems (70Q05) Automated systems (robots, etc.) in control theory (93C85) Discriminantal varieties and configuration spaces in algebraic topology (55R80)
Abstract: Let be a simplicial complex with a piecewise linear function . The Reeb graph is the quotient of , where we collapse each connected component of to a single point. Let the nodes of be all homologically critical points where any homology of the corresponding component of the level set changes. Then we can label every arc of with the Betti numbers of the corresponding -dimensional component of a level set. The homology labels give more information about the original complex than the classical Reeb graph. We describe a canonical embedding of a Reeb graph into a multi-page book (a star cross a line) and give a unique linear code of this book embedding.
Recommendations
Cited in
(5)
This page was built for publication: Computing braid groups of graphs with applications to robot motion planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424856)