default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaliy Kurlin
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Vitaliy Kurlin:
Mathematics of 2-Dimensional Lattices. Found. Comput. Math. 24(3): 805-863 (2024)- [j10]Philip Smith, Vitaliy Kurlin:
Generic families of finite metric spaces with identical or trivial 1-dimensional persistence. J. Appl. Comput. Topol. 8(3): 839-855 (2024) - [i32]Jonathan Balasingham, Viktor Zamaraev
, Vitaliy Kurlin:
Accelerating Material Property Prediction using Generically Complete Isometry Invariants. CoRR abs/2401.15089 (2024) - 2023
- [j9]Olga Anosova, Vitaliy Kurlin:
Density Functions of Periodic Sequences of Continuous Events. J. Math. Imaging Vis. 65(5): 689-701 (2023) - [j8]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) - [c21]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: 1275-1284 - [c20]Yury Elkin, Vitaliy Kurlin:
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. ICML 2023: 9267-9311 - [i31]Olga Anosova, Vitaliy Kurlin:
Density functions of periodic sequences of continuous events. CoRR abs/2301.05137 (2023) - [i30]Vitaliy Kurlin:
The strength of a simplex is the key to a continuous isometry classification of Euclidean clouds of unlabelled points. CoRR abs/2303.13486 (2023) - [i29]Vitaliy Kurlin:
Simplexwise Distance Distributions for finite spaces with metrics and measures. CoRR abs/2303.14161 (2023) - [i28]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 abs/2303.15385 (2023) - [i27]Daniel Schwalbe-Koda, Daniel E. Widdowson, Tuan Anh Pham, Vitaliy A. Kurlin:
Inorganic synthesis-structure maps in zeolites with machine learning and crystallographic distances. CoRR abs/2307.10935 (2023) - 2022
- [c19]Olga Anosova, Vitaliy Kurlin:
Density Functions of Periodic Sequences. DGMM 2022: 395-408 - [c18]Philip Smith, Vitaliy Kurlin:
A Practical Algorithm for Degree-k Voronoi Domains of Three-Dimensional Periodic Point Sets. ISVC (1) 2022: 377-391 - [c17]Daniel Widdowson, Vitaliy Kurlin:
Resolving the data ambiguity for periodic crystals. NeurIPS 2022 - [i26]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 abs/2201.06553 (2022) - [i25]Philip Smith, Vitaliy Kurlin:
Families of point sets with identical 1D persistence. CoRR abs/2202.00577 (2022) - [i24]Miloslav Torda, John Yannis Goulermas, Roland Púcek, Vitaliy Kurlin:
Entropic trust region for densest crystallographic symmetry group packings. CoRR abs/2202.11959 (2022) - [i23]Olga Anosova, Vitaliy Kurlin:
Density functions of periodic sequences. CoRR abs/2205.02226 (2022) - [i22]Vitaliy Kurlin:
A computable and continuous metric on isometry classes of high-dimensional periodic sequences. CoRR abs/2205.04388 (2022) - [i21]Vitaliy Kurlin:
Computable complete invariants for finite clouds of unlabeled points under Euclidean isometry. CoRR abs/2207.08502 (2022) - [i20]Yury Elkin, Vitaliy Kurlin:
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. CoRR abs/2208.09447 (2022) - [i19]Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin:
Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. CoRR abs/2212.11246 (2022) - 2021
- [j7]Philip Smith, Vitaliy Kurlin:
Skeletonisation algorithms with theoretical guarantees for unorganised point clouds with high levels of noise. Pattern Recognit. 115: 107902 (2021) - [c16]Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken:
The Density Fingerprint of a Periodic Point Set. SoCG 2021: 32:1-32:16 - [c15]Olga Anosova, Vitaliy Kurlin:
An Isometry Classification of Periodic Point Sets. DGMM 2021: 229-241 - [i18]Olga Anosova, Vitaliy Kurlin:
Introduction to Periodic Geometry and Topology. CoRR abs/2103.02749 (2021) - [i17]Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken:
The Density Fingerprint of a Periodic Point Set. CoRR abs/2104.11046 (2021) - [i16]Daniel Widdowson, Vitaliy Kurlin:
Pointwise distance distributions of periodic sets. CoRR abs/2108.04798 (2021) - [i15]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 abs/2108.07233 (2021) - [i14]Matthew Bright, Andrew I. Cooper, Vitaliy Kurlin:
Easily computable continuous metrics on the space of isometry classes of all 2-dimensional lattices. CoRR abs/2109.10885 (2021) - [i13]Matthew Bright, Andrew I. Cooper, Vitaliy Kurlin:
A complete and continuous map of the Lattice Isometry Space for all 3-dimensional lattices. CoRR abs/2109.11538 (2021) - [i12]Yury Elkin, Vitaliy Kurlin:
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence. CoRR abs/2111.04617 (2021) - [i11]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 abs/2111.15478 (2021) - 2020
- [j6]Matthew Bright, Vitaliy Kurlin:
Encoding and topological computation on textile structures. Comput. Graph. 90: 51-61 (2020) - [j5]Vitaliy Kurlin, Grzegorz Muszynski:
Persistence-based resolution-independent meshes of superpixels. Pattern Recognit. Lett. 131: 300-306 (2020) - [c14]Thomas Welsch, Vitaliy Kurlin:
Synthesis through unification genetic programming. GECCO 2020: 1029-1036 - [c13]Grzegorz Muszynski, Prabhat, Jan Balewski, Karthik Kashinath, Michael F. Wehner, Vitaliy Kurlin:
Atmospheric Blocking Pattern Recognition in Global Climate Model Simulation Data. ICPR 2020: 677-684 - [c12]Yury Elkin, Vitaliy Kurlin:
The Mergegram of a Dendrogram and Its Stability. MFCS 2020: 32:1-32:13 - [c11]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: 137-146 - [i10]Marco Michele Mosca, Vitaliy Kurlin:
Voronoi-based similarity distances between arbitrary crystal lattices. CoRR abs/2002.11165 (2020) - [i9]Yury Elkin, Di Liu, Vitaliy Kurlin:
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space. CoRR abs/2007.08900 (2020) - [i8]Yury Elkin, Vitaliy Kurlin:
The mergegram of a dendrogram and its stability. CoRR abs/2007.11278 (2020)
2010 – 2019
- 2019
- [j4]Sara Kalisnik, Vitaliy Kurlin, Davorin Lesnik:
A higher-dimensional homologically persistent skeleton. Adv. Appl. Math. 102: 113-142 (2019) - [c10]Vitaliy Kurlin, Grzegorz Muszynski:
A Persistence-Based Approach to Automatic Detection of Line Segments in Images. CTIC 2019: 137-150 - [c9]Vitaliy Kurlin, Philip Smith:
Resolution-Independent Meshes of Superpixels. ISVC (1) 2019: 194-205 - [i7]Vitaliy Kurlin, Philip Smith:
Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees. CoRR abs/1901.03319 (2019) - [i6]Vitaliy Kurlin, Philip Smith:
Resolution-independent meshes of super pixels. CoRR abs/1910.13323 (2019) - 2017
- [j3]Jeremy Forsythe, Vitaliy Kurlin:
Convex constrained meshes for superpixel segmentations of images. J. Electronic Imaging 26(6): 61609 (2017) - [c8]Vitaliy Kurlin, Donald Harvey:
Superpixels Optimized by Color and Shape. EMMCVPR 2017: 297-311 - 2016
- [j2]Vitaliy Kurlin:
A fast persistence-based segmentation of noisy 2D clouds with provable guarantees. Pattern Recognit. Lett. 83: 3-12 (2016) - [c7]Jeremy Forsythe, Vitaliy Kurlin, Andrew W. Fitzgibbon:
Resolution-Independent Superpixels Based on Convex Constrained Meshes Without Small Angles. ISVC (1) 2016: 223-233 - 2015
- [j1]Vitaliy Kurlin:
A one-dimensional homologically persistent skeleton of an unstructured point cloud in any metric space. Comput. Graph. Forum 34(5): 253-262 (2015) - [c6]Vitaliy Kurlin:
A Homologically Persistent Skeleton is a Fast and Robust Descriptor of Interest Points in 2D Images. CAIP (1) 2015: 606-617 - [c5]Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin:
Relaxed Disk Packing. CCCG 2015 - [c4]Vitaliy Kurlin:
A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages. IVAPP 2015: 5-16 - [c3]Vitaliy Kurlin, Christopher Smithers:
A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book. VISIGRAPP (Selected Papers) 2015: 99-122 - [i5]Herbert Edelsbrunner, Mabel Iglesias Ham, Vitaliy Kurlin:
Relaxed Disk Packing. CoRR abs/1505.03402 (2015) - 2014
- [c2]Vitaliy Kurlin:
A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds. CVPR 2014: 1458-1463 - [c1]Vitaliy Kurlin:
Auto-completion of Contours in Sketches, Maps, and Sparse 2D Images Based on Topological Persistence. SYNASC 2014: 594-601 - 2013
- [i4]Vitaliy Kurlin:
Persistent homotopy types of noisy images. CoRR abs/1312.1492 (2013) - [i3]Vitaliy Kurlin:
Book embeddings of Reeb graphs. CoRR abs/1312.1725 (2013)
2000 – 2009
- 2009
- [i2]Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
On Descriptional Complexity of the Planarity Problem for Gauss Words. CoRR abs/0907.4180 (2009) - 2007
- [i1]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 abs/0710.1001 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
