Vitaliy Kurlin

66 papers A* 5A 1B 2Misc 1Journal 45Unranked 12

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