Computational differential topology

• Published in: Applied general topology Vol. 8; no. 1; pp. 35 - 92
• Main Authors: Blackmore, Denis, Mileyko, Yuriy
• Format: Journal Article
• Language: English
• Published: Universitat Politècnica de València 01.04.2007
• Subjects: decidable; Effectively computable; Embeddings; Homology; Isotopy; Obstructions; Shape; sl-projective varieties; Stratification; Varieties
• ISSN: 1576-9402; 1989-4147
• DOI: 10.4995/agt.2007.1909

Some of the more differential aspects of the nascent field of computational topology are introduced and treated in considerable depth. Relevant categories based upon stratified geometric objects are proposed, and fundamental problems are identified and discussed in the context of both differential topology and computer science. New results on the triangulation of objects in the computational differential categories are proven, and evaluated from the perspective of effective computability (algorithmic solvability). In addition, the elements of innovative, effectively computable approaches for analyzing and obtaining computer generated representations of geometric objects based upon singularity/stratification theory and obstruction theory are formulated. New methods for characterizing complicated intersection sets are proven using differential analysis and homology theory. Also included are brief descriptions of several implementation aspects of some of the approaches described, as well as applications of the results in such areas as virtual sculpting, virtual surgery, modeling of heterogeneous biomaterials, and high speed visualizations.