Computing connectedness: An exercise in computational topology

DOI10.1088/0951-7715/11/4/009zbMath0957.54010OpenAlexW2000161327WikidataQ62387661 ScholiaQ62387661MaRDI QIDQ4208715

Elizabeth Bradley, James D. Meiss, Vanessa Robins

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

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

Related Items (9)

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

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