Article ID Journal Published Year Pages File Type
8904071 Topology and its Applications 2018 11 Pages PDF
Abstract
We present criteria for approximability by embeddings (P. Minc, 1997, M. Skopenkov, 2003) and their algorithmic corollaries. We introduce the van Kampen (or Hanani-Tutte) obstruction for approximability by embeddings and discuss its completeness. We discuss analogous problems of moving graphs in the plane apart (cf. S. Spież and H. Toruńczyk, 1991) and finding closest embeddings (H. Edelsbrunner). We present higher dimensional generalizations, including completeness of the van Kampen obstruction and its algorithmic corollary (D. Repovš and A. Skopenkov, 1998).
Related Topics
Physical Sciences and Engineering Mathematics Geometry and Topology
Authors
,