Vitaliy Kurlin
Orcid: 0000-0001-5328-5351Affiliations:
- University of Liverpool, UK
According to our database1,
Vitaliy Kurlin
authored at least 55 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on kurlin.org
On csauthors.net:
Bibliography
2024
Accelerating Material Property Prediction using Generically Complete Isometry Invariants.
CoRR, 2024
2023
J. Math. Imaging Vis., October, 2023
SIAM J. Sci. Comput., August, 2023
Inorganic synthesis-structure maps in zeolites with machine learning and crystallographic distances.
CoRR, 2023
CoRR, 2023
The strength of a simplex is the key to a continuous isometry classification of Euclidean clouds of unlabelled points.
CoRR, 2023
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.
Proceedings of the International Conference on Machine Learning, 2023
Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023
2022
Compact Graph Representation of molecular crystals using Point-wise Distance Distributions.
CoRR, 2022
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.
CoRR, 2022
Computable complete invariants for finite clouds of unlabeled points under Euclidean isometry.
CoRR, 2022
A computable and continuous metric on isometry classes of high-dimensional periodic sequences.
CoRR, 2022
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space.
CoRR, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
A Practical Algorithm for Degree-k Voronoi Domains of Three-Dimensional Periodic Point Sets.
Proceedings of the Advances in Visual Computing - 17th International Symposium, 2022
Proceedings of the Discrete Geometry and Mathematical Morphology, 2022
2021
Skeletonisation algorithms with theoretical guarantees for unorganised point clouds with high levels of noise.
Pattern Recognit., 2021
A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces.
CoRR, 2021
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence.
CoRR, 2021
A complete and continuous map of the Lattice Isometry Space for all 3-dimensional lattices.
CoRR, 2021
Easily computable continuous metrics on the space of isometry classes of all 2-dimensional lattices.
CoRR, 2021
Fast predictions of lattice energies by continuous isometry invariants of crystal structures.
CoRR, 2021
Proceedings of the Discrete Geometry and Mathematical Morphology, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
Pattern Recognit. Lett., 2020
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space.
CoRR, 2020
Polygonal Meshes of Highly Noisy Images based on a New Symmetric Thinning Algorithm with Theoretical Guarantees.
Proceedings of the 15th International Joint Conference on Computer Vision, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the 25th International Conference on Pattern Recognition, 2020
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
2019
CoRR, 2019
Proceedings of the Advances in Visual Computing, 2019
Proceedings of the Computational Topology in Image Context - 7th International Workshop, 2019
2017
J. Electronic Imaging, 2017
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2017
2016
Pattern Recognit. Lett., 2016
Resolution-Independent Superpixels Based on Convex Constrained Meshes Without Small Angles.
Proceedings of the Advances in Visual Computing - 12th International Symposium, 2016
2015
A one-dimensional homologically persistent skeleton of an unstructured point cloud in any metric space.
Comput. Graph. Forum, 2015
Proceedings of the Computer Vision, Imaging and Computer Graphics Theory and Applications, 2015
Proceedings of the IVAPP 2015, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
A Homologically Persistent Skeleton is a Fast and Robust Descriptor of Interest Points in 2D Images.
Proceedings of the Computer Analysis of Images and Patterns, 2015
2014
Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014
Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014
2013
2009
2007
How Many Randomly Distributed Wireless Sensors Are Enough To Make a 1-Dimensional Network Connected With a Given Probability?
CoRR, 2007