Computing connectedness: An exercise in computational topology

DOI10.1088/0951-7715/11/4/009MaRDI QIDQ4208715zbMATH OpenOpenAlexWikidataFDO

Authors Elizabeth Bradley, V. Robins, J. D. Meiss

Publication date 29 March 2001

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2ee57d56a4977e77fb3d229f12db83895751257c

zbMATH Keywords

disconnectedness index

Mathematics Subject Classification ID

Connected and locally connected spaces (general aspects) (54D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing connectedness: disconnectedness and discreteness.
• Computing the conjugacy of invariant tori for volume-preserving maps
• Excision-preserving cubical approach to the algorithmic computation of the discrete Conley index
• Fundamental properties of \(\varepsilon\)-connected sets

Cited in

(11)

• -connectedness, finite approximations, shape theory and coarse graining in hyperspaces
• Computing connectedness: disconnectedness and discreteness.
• Connectivity calculus of fractal polyhedrons
• Fundamental properties of \(\varepsilon\)-connected sets
• Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
• scientific article; zbMATH DE number 1137956 (Why is no real title available?)
• scientific article; zbMATH DE number 6897325 (Why is no real title available?)
• Topological data analysis for true step detection in periodic piecewise constant signals
• Topology-based signal separation
• Reasoning about nonlinear system identification
• What Are Higher-Order Networks?

This page was built for publication: Computing connectedness: An exercise in computational topology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208715)