Algorithms and data structures for computer topology

  • Authors:
  • Vladimir Kovalevsky

  • Affiliations:
  • Institute of Computer Graphics, University of Rostock, Albert-Einstein-Str. 21, 18051 Rostock, Germany

  • Venue:
  • Digital and image geometry
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents an introduction to computer topology with applications to image processing and computer graphics. Basic topological notions such as connectivity, frontier, manifolds, surfaces, combinatorial homeomorphism etc. are recalled and adapted for locally finite topological spaces. The paper describes data structures for explicitly representing classical topological spaces in computers and presents some algorithms for computing topological features of sets. Among them are: boundary tracing (n=2,3), filling of interiors (n=2,3,4), labeling of components, computing of skeletons and others.