How Many Randomly Distributed Wireless Sensors Are Enough To Make a 1-Dimensional Network Connected With a Given Probability? - Vitaliy Kurlin; Lyudmila Mihaylova; Simon Maskell (CoRR, 2007)

On Descriptional Complexity of the Planarity Problem for Gauss Words - Vitaliy Kurlin; Alexei Lisitsa 001; Igor Potapov; Rafiq Saleh (CoRR, 2009)

Persistent homotopy types of noisy images. - Vitaliy Kurlin (CoRR, 2013)

Book embeddings of Reeb graphs. - Vitaliy Kurlin (CoRR, 2013)

A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds. - Vitaliy Kurlin (CVPR, 2014)

Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence. - Vitaliy Kurlin (SYNASC, 2014)

A Homologically Persistent Skeleton is a Fast and Robust Descriptor of Interest Points in 2D Images. - Vitaliy Kurlin (CAIP (1), 2015)

Relaxed Disk Packing. - Mabel Iglesias Ham; Herbert Edelsbrunner; Vitaliy Kurlin (CCCG, 2015)

A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages. - Vitaliy Kurlin (IVAPP, 2015)

A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book. - Vitaliy Kurlin; Christopher Smithers (VISIGRAPP (Selected Papers), 2015)

A one-dimensional homologically persistent skeleton of an unstructured point cloud in any metric space. - Vitaliy Kurlin (Comput. Graph. Forum, 2015)

Resolution-Independent Superpixels Based on Convex Constrained Meshes Without Small Angles. - Jeremy Forsythe; Vitaliy Kurlin; Andrew W. Fitzgibbon (ISVC (1), 2016)

A fast persistence-based segmentation of noisy 2D clouds with provable guarantees. - Vitaliy Kurlin (Pattern Recognit. Lett., 2016)

Superpixels Optimized by Color and Shape. - Vitaliy Kurlin; Donald Harvey (EMMCVPR, 2017)

Convex constrained meshes for superpixel segmentations of images. - Jeremy Forsythe; Vitaliy Kurlin (J. Electronic Imaging, 2017)

A Persistence-Based Approach to Automatic Detection of Line Segments in Images. - Vitaliy Kurlin; Grzegorz Muszynski (CTIC, 2019)

Resolution-Independent Meshes of Superpixels. - Vitaliy Kurlin; Philip Smith (ISVC (1), 2019)

A higher-dimensional homologically persistent skeleton. - Sara Kalisnik; Vitaliy Kurlin; Davorin Lesnik (Adv. Appl. Math., 2019)

Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees. - Vitaliy Kurlin; Philip Smith (CoRR, 2019)

Resolution-independent meshes of super pixels. - Vitaliy Kurlin; Philip Smith (CoRR, 2019)

Synthesis through unification genetic programming. - Thomas Welsch; Vitaliy Kurlin (GECCO, 2020)

Atmospheric Blocking Pattern Recognition in Global Climate Model Simulation Data. - Grzegorz Muszynski; Prabhat; Jan Balewski; Karthik Kashinath; Michael F. Wehner; Vitaliy Kurlin (ICPR, 2020)

The Mergegram of a Dendrogram and Its Stability. - Yury Elkin; Vitaliy Kurlin (MFCS, 2020)

Polygonal Meshes of Highly Noisy Images based on a New Symmetric Thinning Algorithm with Theoretical Guarantees. - Mohammed Arshad Siddiqui; Vitaliy Kurlin (VISIGRAPP (4: VISAPP), 2020)

Encoding and topological computation on textile structures. - Matthew Bright; Vitaliy Kurlin (Comput. Graph., 2020)

Voronoi-based similarity distances between arbitrary crystal lattices. - Marco Michele Mosca; Vitaliy Kurlin (CoRR, 2020)

A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space. - Yury Elkin; Di Liu; Vitaliy Kurlin (CoRR, 2020)

Persistence-based resolution-independent meshes of superpixels. - Vitaliy Kurlin; Grzegorz Muszynski (Pattern Recognit. Lett., 2020)

The Density Fingerprint of a Periodic Point Set. - Herbert Edelsbrunner; Teresa Heiss; Vitaliy Kurlin; Philip Smith; Mathijs Wintraecken (SoCG, 2021)

An Isometry Classification of Periodic Point Sets. - Olga Anosova; Vitaliy Kurlin (DGMM, 2021)

Introduction to Periodic Geometry and Topology. - Olga Anosova; Vitaliy Kurlin (CoRR, 2021)

Pointwise distance distributions of periodic sets. - Daniel Widdowson; Vitaliy Kurlin (CoRR, 2021)

Fast predictions of lattice energies by continuous isometry invariants of crystal structures. - Jakob Ropers; Marco M. Mosca; Olga Anosova; Vitaliy Kurlin; Andrew I. Cooper (CoRR, 2021)

Easily computable continuous metrics on the space of isometry classes of all 2-dimensional lattices. - Matthew Bright; Andrew I. Cooper; Vitaliy Kurlin (CoRR, 2021)

A complete and continuous map of the Lattice Isometry Space for all 3-dimensional lattices. - Matthew Bright; Andrew I. Cooper; Vitaliy Kurlin (CoRR, 2021)

Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence. - Yury Elkin; Vitaliy Kurlin (CoRR, 2021)

A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. - Yury Elkin; Vitaliy Kurlin (CoRR, 2021)

Skeletonisation algorithms with theoretical guarantees for unorganised point clouds with high levels of noise. - Philip Smith; Vitaliy Kurlin (Pattern Recognit., 2021)

Density Functions of Periodic Sequences. - Olga Anosova; Vitaliy Kurlin (DGMM, 2022)

A Practical Algorithm for Degree-k Voronoi Domains of Three-Dimensional Periodic Point Sets. - Philip Smith; Vitaliy Kurlin (ISVC (1), 2022)

Resolving the data ambiguity for periodic crystals. - Daniel Widdowson; Vitaliy Kurlin (NeurIPS, 2022)

Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space. - Yury Elkin; Vitaliy Kurlin (CoRR, 2022)

Families of point sets with identical 1D persistence. - Philip Smith; Vitaliy Kurlin (CoRR, 2022)

A computable and continuous metric on isometry classes of high-dimensional periodic sequences. - Vitaliy Kurlin (CoRR, 2022)

Computable complete invariants for finite clouds of unlabeled points under Euclidean isometry. - Vitaliy Kurlin (CoRR, 2022)

Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. - Yury Elkin; Vitaliy Kurlin (CoRR, 2022)

Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. - Jonathan Balasingham; Viktor Zamaraev; Vitaliy Kurlin (CoRR, 2022)

Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives. - Daniel Widdowson; Vitaliy Kurlin (CVPR, 2023)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. - Yury Elkin; Vitaliy Kurlin (ICML, 2023)

The strength of a simplex is the key to a continuous isometry classification of Euclidean clouds of unlabelled points. - Vitaliy Kurlin (CoRR, 2023)

Simplexwise Distance Distributions for finite spaces with metrics and measures. - Vitaliy Kurlin (CoRR, 2023)

Inorganic synthesis-structure maps in zeolites with machine learning and crystallographic distances. - Daniel Schwalbe-Koda; Daniel E. Widdowson; Tuan Anh Pham; Vitaliy A. Kurlin (CoRR, 2023)

Entropic Trust Region for Densest Crystallographic Symmetry Group Packings. - Miloslav Torda; John Yannis Goulermas; Roland Púcek; Vitaliy Kurlin (SIAM J. Sci. Comput., 2023)

Density Functions of Periodic Sequences of Continuous Events. - Olga Anosova; Vitaliy Kurlin (J. Math. Imaging Vis., 2023)

Accelerating Material Property Prediction using Generically Complete Isometry Invariants. - Jonathan Balasingham; Viktor Zamaraev; Vitaliy Kurlin (CoRR, 2024)

Complete and bi-continuous invariant of protein backbones under rigid motion. - Olga Anosova; Alexey Gorelov; William Jeffcott; Ziqiu Jiang; Vitaliy Kurlin (CoRR, 2024)

Computing the bridge length: the key ingredient in a continuous isometry classification of periodic point sets. - Jonathan McManus; Vitaliy Kurlin (CoRR, 2024)

Mathematics of 2-Dimensional Lattices. - Vitaliy Kurlin (Found. Comput. Math., 2024)

Generic families of finite metric spaces with identical or trivial 1-dimensional persistence. - Philip Smith; Vitaliy Kurlin (J. Appl. Comput. Topol., 2024)

Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees. - Olga Anosova; Daniel E. Widdowson; Vitaliy A. Kurlin (Pattern Recognit., 2026)