Blar i Department of Informatics på forfatter "Blaser, Nello"
-
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth
Black, Mitchell; Blaser, Nello; Nayyeri, Amir; Vågset, Erlend Raa (Journal article; Peer reviewed, 2022)Given a simplicial complex with n simplices, we consider the Connected Subsurface Recognition (c-SR) problem of finding a subcomplex that is homeomorphic to a given connected surface with a fixed boundary. We also study ... -
Relative Persistent Homology
Blaser, Nello; Brun, Morten (Journal article; Peer reviewed, 2020)The alpha complex efficiently computes persistent homology of a point cloud X in Euclidean space when the dimension d is low. Given a subset A of X, relative persistent homology can be computed as the persistent homology ... -
Relative Persistent Homology
Blaser, Nello; Brun, Morten (Journal article; Peer reviewed, 2022)The alpha complex efficiently computes persistent homology of a point cloud X in Euclidean space when the dimension d is low. Given a subset A of X, relative Čech persistent homology can be computed as the persistent ... -
Sparse Nerves in Practice
Blaser, Nello; Brun, Morten (Peer reviewed; Journal article, 2019)Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...