Quick search Find article
Quick search
Find article

Computing connectedness: An exercise in computational topology

V Robins, J D Meiss and E Bradley

Show affiliations


Recommended by P Grassberger

We reformulate the notion of connectedness for compact metric spaces in a manner that may be implemented computationally. In particular, our techniques can distinguish between sets that are connected, have a finite number of connected components, have infinitely many connected components, or are totally disconnected. We hope that this approach will prove useful for studying structures in the phase space of dynamical systems.


PACS

02.40.-k Geometry, differential geometry, and topology

02.70.-c Computational techniques

MSC

54D05 Connected and locally connected spaces (general aspects)

54E45 Compact (locally compact) metric spaces

68U05 Computer graphics; computational geometry (See also 65D18)

Subjects

Mathematical physics

Computational physics

Dates

Issue 4 (July 1998)

Received 7 October 1997



Related review articles

What's this?
View review articles related to this research to gain an insight into the key trends in this subject area. Related review articles are selected based on PACS/MSC codes, and are no more than three years old.

  1. Imaging with LINC-NIRVANA, the Fizeau interferometer of the Large Binocular Telescope: state of the art and open problems
  2. On the uncertainty in the regularized solution
  3. Sequences close to periodic
More

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.