Treffer: Algorithms and data structures for computer topology

Title:
Algorithms and data structures for computer topology
Source:
Digital and image geometry : advanced lectures (Schloss Dagstuhl, 18-22 December 2000)Lecture notes in computer science. :38-58
Publisher Information:
Berlin: Springer, 2001.
Publication Year:
2001
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Computer Graphics, University of Rostock Albert-Einstein-Str. 21, 18051 Rostock, Germany
ISSN:
0302-9743
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14051818
Database:
PASCAL Archive

Weitere Informationen

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.