Computing braid groups of graphs with applications to robot motion planning

From MaRDI portal




Abstract: Let X be a simplicial complex with a piecewise linear function f:XomathbbR. The Reeb graph Reeb(f,X) is the quotient of X, where we collapse each connected component of f1(t) to a single point. Let the nodes of Reeb(f,X) be all homologically critical points where any homology of the corresponding component of the level set f1(t) changes. Then we can label every arc of Reeb(f,X) with the Betti numbers of the corresponding d-dimensional component of a level set. The homology labels give more information about the original complex X 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.









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)