Vitaliy Kurlin

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 50

Top Topics

Top Venues

Pattern Recognit. Lett.

Publications

Vitaliy Kurlin
Mathematics of 2-Dimensional Lattices. Found. Comput. Math. 24 (3) (2024)
Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin
Accelerating Material Property Prediction using Generically Complete Isometry Invariants. CoRR (2024)
Miloslav Torda, John Yannis Goulermas, Roland Púcek, Vitaliy Kurlin
Entropic Trust Region for Densest Crystallographic Symmetry Group Packings. SIAM J. Sci. Comput. 45 (4) (2023)
Daniel Widdowson, Vitaliy Kurlin
Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives. CoRR (2023)
Olga Anosova, Vitaliy Kurlin
Density Functions of Periodic Sequences of Continuous Events. J. Math. Imaging Vis. 65 (5) (2023)
Daniel Widdowson, Vitaliy Kurlin
Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives. CVPR (2023)
Olga Anosova, Vitaliy Kurlin
Density functions of periodic sequences of continuous events. CoRR (2023)
Vitaliy Kurlin
Simplexwise Distance Distributions for finite spaces with metrics and measures. CoRR (2023)
Vitaliy Kurlin
The strength of a simplex is the key to a continuous isometry classification of Euclidean clouds of unlabelled points. CoRR (2023)
Yury Elkin, Vitaliy Kurlin
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. ICML (2023)
Philip Smith, Vitaliy Kurlin
A Practical Algorithm for Degree-k Voronoi Domains of Three-Dimensional Periodic Point Sets. ISVC (1) (2022)
Philip Smith, Vitaliy Kurlin
Families of point sets with identical 1D persistence. CoRR (2022)
Vitaliy Kurlin
Computable complete invariants for finite clouds of unlabeled points under Euclidean isometry. CoRR (2022)
Vitaliy Kurlin
A computable and continuous metric on isometry classes of high-dimensional periodic sequences. CoRR (2022)
Miloslav Torda, John Yannis Goulermas, Roland Púcek, Vitaliy Kurlin
Entropic trust region for densest crystallographic symmetry group packings. CoRR (2022)
Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin
Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. CoRR (2022)
Olga Anosova, Vitaliy Kurlin
Density Functions of Periodic Sequences. DGMM (2022)
Daniel Widdowson, Vitaliy Kurlin
Resolving the data ambiguity for periodic crystals. NeurIPS (2022)
Yury Elkin, Vitaliy Kurlin
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. CoRR (2022)
Olga Anosova, Vitaliy Kurlin
Density functions of periodic sequences. CoRR (2022)
Yury Elkin, Vitaliy Kurlin
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space. CoRR (2022)
Daniel Widdowson, Vitaliy Kurlin
Pointwise distance distributions of periodic sets. CoRR (2021)
Philip Smith, Vitaliy Kurlin
Skeletonisation algorithms with theoretical guarantees for unorganised point clouds with high levels of noise. Pattern Recognit. 115 (2021)
Matthew Bright, Andrew I. Cooper, Vitaliy Kurlin
Easily computable continuous metrics on the space of isometry classes of all 2-dimensional lattices. CoRR (2021)
Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken
The Density Fingerprint of a Periodic Point Set. SoCG (2021)
Yury Elkin, Vitaliy Kurlin
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence. CoRR (2021)
Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken
The Density Fingerprint of a Periodic Point Set. CoRR (2021)
Olga Anosova, Vitaliy Kurlin
An Isometry Classification of Periodic Point Sets. DGMM (2021)
Yury Elkin, Vitaliy Kurlin
A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. CoRR (2021)
Jakob Ropers, Marco M. Mosca, Olga Anosova, Vitaliy Kurlin, Andrew I. Cooper
Fast predictions of lattice energies by continuous isometry invariants of crystal structures. CoRR (2021)
Olga Anosova, Vitaliy Kurlin
Introduction to Periodic Geometry and Topology. CoRR (2021)
Matthew Bright, Andrew I. Cooper, Vitaliy Kurlin
A complete and continuous map of the Lattice Isometry Space for all 3-dimensional lattices. CoRR (2021)
Yury Elkin, Vitaliy Kurlin
The mergegram of a dendrogram and its stability. CoRR (2020)
Yury Elkin, Di Liu, Vitaliy Kurlin
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space. CoRR (2020)
Mohammed Arshad Siddiqui, Vitaliy Kurlin
Polygonal Meshes of Highly Noisy Images based on a New Symmetric Thinning Algorithm with Theoretical Guarantees. VISIGRAPP (4: VISAPP) (2020)
Matthew Bright, Vitaliy Kurlin
Encoding and topological computation on textile structures. Comput. Graph. 90 (2020)
Grzegorz Muszynski, Prabhat, Jan Balewski, Karthik Kashinath, Michael F. Wehner, Vitaliy Kurlin
Atmospheric Blocking Pattern Recognition in Global Climate Model Simulation Data. ICPR (2020)
Vitaliy Kurlin, Grzegorz Muszynski
Persistence-based resolution-independent meshes of superpixels. Pattern Recognit. Lett. 131 (2020)
Yury Elkin, Vitaliy Kurlin
The Mergegram of a Dendrogram and Its Stability. MFCS (2020)
Marco Michele Mosca, Vitaliy Kurlin
Voronoi-based similarity distances between arbitrary crystal lattices. CoRR (2020)
Thomas Welsch, Vitaliy Kurlin
Synthesis through unification genetic programming. GECCO (2020)
Vitaliy Kurlin, Grzegorz Muszynski
A Persistence-Based Approach to Automatic Detection of Line Segments in Images. CTIC (2019)
Vitaliy Kurlin, Philip Smith
Resolution-independent meshes of super pixels. CoRR (2019)
Vitaliy Kurlin, Philip Smith
Resolution-Independent Meshes of Superpixels. ISVC (1) (2019)
Vitaliy Kurlin, Philip Smith
Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees. CoRR (2019)
Sara Kalisnik, Vitaliy Kurlin, Davorin Lesnik
A higher-dimensional homologically persistent skeleton. Adv. Appl. Math. 102 (2019)
Jeremy Forsythe, Vitaliy Kurlin
Convex constrained meshes for superpixel segmentations of images. J. Electronic Imaging 26 (6) (2017)
Vitaliy Kurlin, Donald Harvey
Superpixels Optimized by Color and Shape. EMMCVPR (2017)
Jeremy Forsythe, Vitaliy Kurlin, Andrew W. Fitzgibbon
Resolution-Independent Superpixels Based on Convex Constrained Meshes Without Small Angles. ISVC (1) (2016)
Vitaliy Kurlin
A fast persistence-based segmentation of noisy 2D clouds with provable guarantees. Pattern Recognit. Lett. 83 (2016)
Vitaliy Kurlin
A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages. IVAPP (2015)
Vitaliy Kurlin
A one-dimensional homologically persistent skeleton of an unstructured point cloud in any metric space. Comput. Graph. Forum 34 (5) (2015)
Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin
Relaxed Disk Packing. CCCG (2015)
Vitaliy Kurlin, Christopher Smithers
A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book. VISIGRAPP (Selected Papers) (2015)
Herbert Edelsbrunner, Mabel Iglesias Ham, Vitaliy Kurlin
Relaxed Disk Packing. CoRR (2015)
Vitaliy Kurlin
A Homologically Persistent Skeleton is a Fast and Robust Descriptor of Interest Points in 2D Images. CAIP (1) (2015)
Vitaliy Kurlin
A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds. CVPR (2014)
Vitaliy Kurlin
Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence. SYNASC (2014)
Vitaliy Kurlin
Persistent homotopy types of noisy images. CoRR (2013)
Vitaliy Kurlin
Book embeddings of Reeb graphs. CoRR (2013)
Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov, Rafiq Saleh
On Descriptional Complexity of the Planarity Problem for Gauss Words CoRR (2009)
Vitaliy Kurlin, Lyudmila Mihaylova, Simon Maskell
How Many Randomly Distributed Wireless Sensors Are Enough To Make a 1-Dimensional Network Connected With a Given Probability? CoRR (2007)