nLab computational topology

Computational topology

Context

Topology

topology (point-set topology, point-free topology)

see also differential topology, algebraic topology, functional analysis and topological homotopy theory

Introduction

Basic concepts

Universal constructions

Extra stuff, structure, properties

Examples

Basic statements

Theorems

Analysis Theorems

topological homotopy theory

Constructivism, Realizability, Computability

Computational topology

Overview

Computational topology is a relatively new area of study. It emerged in response to topological problems that arise in computer graphics, robotics and planning. There are interactions with dynamical systems, and computational geometry.

Subareas

Related areas include

See also:

References

General

Textbook accounts:

See also:

Computational algebraic topology

  • Rolf Schön: Effective Algebraic Topology, Memoirs of the AMS 451, AMS (1991) [ams:memo-92-451]

Constructive\;homology groups and homotopy groups:

Computational Homotopy groups

Discussion of (equivariant) homotopies and homotopy groups in computational topology:

and on the extension-problem:

Computational Cohomotopy sets

Discussion of Cohomotopy-sets in computational topology:

Last revised on September 19, 2024 at 10:42:28. See the history of this page for a list of all contributions to it.