Browse by People

Fiedler, Thomas and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2010) A 1-parameter approach to links in a solid torus. JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN, 62 (1). pp. 167-211.

Vriza, Aikaterini ORCID: 0000-0002-5663-8703 (2022) Accelerating Molecular Materials Discovery Following Data-Driven Approaches. PhD thesis, University of Liverpool.

Zhu, Qiang, Johal, Jay, Widdowson, Daniel E ORCID: 0000-0002-5958-0703, Pang, Zhongfu, Li, Boyu, Kane, Christopher M, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Day, Graeme M, Little, Marc A and Cooper, Andrew I ORCID: 0000-0003-0201-1021 (2022) Analogy Powered by Prediction and Structural Invariants: Computationally Led Discovery of a Mesoporous Hydrogen-Bonded Organic Cage Crystal. JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 144 (22). pp. 9893-9901.

Muszynski, Grzegorz, Prabhat, , Balewski, Jan, Kashinath, Karthik, Wehner, Michael, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and SOC, IEEE COMP (2021) Atmospheric Blocking Pattern Recognition in Global Climate Model Simulation Data. In: 2020 25th International Conference on Pattern Recognition (ICPR), 2021-1-10 - 2021-1-15.

Collapse authors list.
Rutz, Jonathan J, Shields, Christine A, Lora, Juan M, Payne, Ashley E, Guan, Bin, Ullrich, Paul, O’Brien, Travis, Leung, L Ruby, Ralph, F Martin, Wehner, Michael et al (show 27 more authors) , Brands, Swen, Collow, Allison, Goldenson, Naomi, Gorodetskaya, Irina, Griffith, Helen, Kashinath, Karthik, Kawzenuk, Brian, Krishnan, Harinarayan, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Lavers, David, Magnusdottir, Gudrun, Mahoney, Kelly, McClenny, Elizabeth, Muszynski, Grzegorz, Nguyen, Phu Dinh, Prabhat, Mr, Qian, Yun, Ramos, Alexandre M, Sarangi, Chandan, Sellars, Scott, Shulgina, T, Tome, Ricardo, Waliser, Duane, Walton, Daniel, Wick, Gary, Wilson, Anna M and Viale, Maximiliano (2019) The Atmospheric River Tracking Method Intercomparison Project (ARTMIP): Quantifying Uncertainties in Atmospheric River Climatology. Journal of Geophysical Research: Atmospheres, 124 (24). pp. 13777-13802.

Widdowson, Daniel ORCID: 0000-0002-5958-0703, Mosca, Marco ORCID: 0000-0002-1764-2814, Pulido, Angeles, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Cooper, Andrew I (2022) Average Minimum Distances of periodic point sets are fundamental invariants for mapping all periodic crystals. MATCH Communications in Mathematical and in Computer Chemistry, 87 (3). pp. 529-559.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2007) The Baker-Campbell-Hausdorff formula in the free metabelian Lie algebra. JOURNAL OF LIE THEORY, 17 (3). pp. 525-538.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2012) COMPUTING BRAID GROUPS OF GRAPHS WITH APPLICATIONS TO ROBOT MOTION PLANNING. HOMOLOGY HOMOTOPY AND APPLICATIONS, 14 (1). pp. 159-180.

Samardzhiev, Krasen (2023) Characterising urban processes using new forms of data and analysis. PhD thesis, University of Liverpool.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2017) Computing Invariants of Knotted Graphs Given by Sequences of Points in 3-Dimensional Space. In: Mathematics and Visualization. Mathematics and Visualization . Springer International Publishing, pp. 349-363. ISBN 9783319446820

Bright, matthew, Cooper, andrew and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Continuous Chiral Distances for 2-Dimensional Lattices. Chirality, 35 (12). pp. 920-936.

Bright, Matthew (2024) Continuous Spaces of Low Dimensional Lattices. PhD thesis, University of Liverpool.

Forsythe, Jeremy and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2017) Convex constrained meshes for superpixel segmentations of images. JOURNAL OF ELECTRONIC IMAGING, 26 (6). p. 1.

Forsythe, Jeremy and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2017) Convex constrained meshes for superpixel segmentations of images. J. Electronic Imaging, 26. 61609 - 61609.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. .

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. In: 2022 Topological Data Analysis and Visualization (TopoInVis), 2022-10-17 - 2022-10-17.

Torda, Miloslav ORCID: 0000-0002-2115-7811, Goulermas, John Y, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Day, Graeme M (2022) Densest plane group packings of regular polygons. [Preprint]

Torda, Miloslav, Goulermas, John Y, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Day, Graeme M (2022) Densest plane group packings of regular polygons. PHYSICAL REVIEW E, 106 (5). 054603-.

Edelsbrunner, Herbert, Heiss, Teresa, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Smith, Philip and Wintraecken, Mathijs (2021) The Density Fingerprint of a Periodic Point Set. In: 37th Symposium of Computational Geometry, 2021-6-7 - 2021-6-11, Buffalo.

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Density Functions of Periodic Sequences. .

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Density functions of periodic sequences. .

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Density functions of periodic sequences of continuous events. Journal of Mathematical Imaging and Vision, 65 (5). pp. 689-701.

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Density functions of periodic sequences of continuous events. [Preprint]

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Density functions of periodic sequences of continuous events. Journal of Mathematical Imaging and Vision, 65 (5). pp. 689-701.

Holloway, Fraser (2022) The Development of Novel Pulse Shape Analysis Algorithms for AGATA. PhD thesis, University of Liverpool.

Ban, Naohiko, Yamazaki, Wataru and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2019) Development of a Reconstruction Method for Major Vortex Structure around Tandem Flapping Wing Object via Vortex Trajectory Method. In: AIAA Scitech 2019 Forum.

Torda, Miloslav ORCID: 0000-0002-2115-7811, Goulermas, Ohn Y, Pucek, Roland and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) ENTROPIC TRUST REGION FOR DENSEST CRYSTALLOGRAPHIC SYMMETRY GROUP PACKINGS. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 45 (4). B493-B522.

Bright, Matt and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) Encoding and topological computation on textile structures. Computers & Graphics, 90. pp. 51-61.

Torda, Miloslav ORCID: 0000-0002-2115-7811, Goulermas, John Y, Púček, Roland and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Entropic trust region for densest crystallographic symmetry group packings. [Preprint]

Ropers, Jakob, Mosca, Marco M, Anosova, Olga, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Cooper, Andrew I (2022) Fast Predictions of Lattice Energies by Continuous Isometry Invariants of Crystal Structures. .

Ropers, Jakob, Mosca, Marco M ORCID: 0000-0002-1764-2814, Anosova, Olga, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Cooper, Andrew I (2021) Fast predictions of lattice energies by continuous isometry invariants of crystal structures. [Preprint]

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2008) Gauss paragraphs of classical links and a characterization of virtual link groups. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 145 (1). pp. 129-140.

Bright, Matthew, Cooper, Andrew I and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Geographic style maps for two-dimensional lattices. ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 79 (Pt 1). pp. 1-13.

Bright, Matthew, Cooper, Andrew I and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) Geographic-style maps for 2-dimensional lattices. [Preprint]

Smith, Philip (2021) Geometric and Topological Methods for Applications to Materials and Data Skeletonisation. PhD thesis, University of Liverpool.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2019) HOW TO CORRECTLY SAMPLE UNIT CELLS IN COMPUTER SIMULATIONS OF CRYSTAL STRUCTURES. .

Kalisnik, Sara, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Lesnik, Davorin (2019) A Higher-Dimensional Homologically Persistent Skeleton. Advances in Applied Mathematics, 102 (Januar). pp. 113-142.

Kalisnik, Sara, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Lesnik, Davorin (2019) A Higher-Dimensional Homologically Persistent Skeleton. Advances in Applied Mathematics, 102. 113 - 142.

Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) An Isometry Classification of Periodic Point Sets. In: Discrete Geometry and Mathematical Morphology, 2021-5-24 - 2021-5-27, https://www.dgmm2021.se.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) Isometry Invariant Shape Recognition of Projectively Perturbed Point Clouds by the Mergegram Extending 0D Persistence. MATHEMATICS, 9 (17). p. 2121.

Mosca, Marco Michele ORCID: 0000-0002-1764-2814 (2022) Isometry Invariants of Crystal Structures Based on Voronoi Domains and Interatomic Distances. PhD thesis, University of Liverpool.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence. CoRR, abs/21.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2019) MATHEMATICAL JUSTIFICATIONS FOR CRYSTAL SYSTEMS, BRAVAIS LATTICES AND A NEW CONTINUOUS CLASSIFICATION. .

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Mathematics of 2-Dimensional Lattices. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS. pp. 1-59.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Mathematics of 2-dimensional lattices. [Preprint]

Torda, Miloslav ORCID: 0000-0002-2115-7811 (2023) Maximally dense crystallographic symmetry group packings for molecular crystal structure prediction acceleration. PhD thesis, University of Liverpool.

Hargreaves, Cameron (2022) Metrics for Materials Discovery. PhD thesis, University of Liverpool.

Vriza, Aikaterini ORCID: 0000-0002-5663-8703, Sovago, Ioana, Widdowson, Daniel, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Wood, Peter A ORCID: 0000-0002-5239-2160 and Dyer, Matthew S ORCID: 0000-0002-4923-3003 (2022) Molecular set transformer: attending to the co-crystals in the Cambridge structural database. Digital Discovery, 1 (6). pp. 834-850.

Collapse authors list.
Vriza, Aikaterini ORCID: 0000-0002-5663-8703, Canaj, Angelos B ORCID: 0000-0002-4944-7909, Vismara, Rebecca ORCID: 0000-0001-9474-7671, Kershaw Cook, Laurence J, Manning, Troy D ORCID: 0000-0002-7624-4306, Gaultois, Michael W ORCID: 0000-0003-2172-2507, Wood, Peter A, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Berry, Neil ORCID: 0000-0003-1928-0738, Dyer, Matthew S ORCID: 0000-0002-4923-3003 et al (show 1 more authors) and Rosseinsky, Matthew J ORCID: 0000-0002-1910-2483 (2021) One class classification as a practical approach for accelerating π–π co-crystal discovery. Chemical Science, 12 (5). pp. 1702-1719.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2022) Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space. [Preprint]

Muszynski, Grzegorz (2021) Pattern Recognition for Weather Phenomena in Climate Data. PhD thesis, University of Liverpool.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Muszynski, Grzegorz (2019) A Persistence-Based Approach to Automatic Detection of Line Segments in Images. In: Computational Topology in Image Context.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Muszynski, Grzegorz (2020) Persistence-based resolution-independent meshes of superpixels. PATTERN RECOGNITION LETTERS, 131. pp. 300-306.

Widdowson, Daniel and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) Pointwise distance distributions of periodic sets. [Preprint]

Siddiqui, Mohammed Arshad and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) Polygonal Meshes of Highly Noisy Images based on a New Symmetric Thinning Algorithm with Theoretical Guarantees. In: 15th International Conference on Computer Vision Theory and Applications, 2020-2-27 - 2020-2-29.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2024) Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points. Match - Communications in Mathematical and in Computer Chemistry, 91 (1). pp. 79-108.

Bright, Matt, Anosova, Olga and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) A Proof of the Invariant Based Formula for the Linking Number and its Asymptotic Behaviour. .

Fiedler, Thomas and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2010) RECOGNIZING TRACE GRAPHS OF CLOSED BRAIDS. OSAKA JOURNAL OF MATHEMATICS, 47 (4). pp. 885-909.

Widdowson, Daniel and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives. [Preprint]

Widdowson, Daniel and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2023) Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants with no False Negatives and no False Positives. In: 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023-6-17 - 2023-6-24, Vancouver, Canada.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Smith, Philip (2020) Resolution-Independent Meshes of Superpixels. In: International Symposium on Visual Computing, 2019-10-7 - 2019-10-9, Lake Tahoe, Nevada, USA.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Smith, Philip (2019) Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees. [Report] (Submitted)

Welsch, Thomas and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) Synthesis through Unification Genetic Programming. In: GECCO '20: Genetic and Evolutionary Computation Conference, 2020-7-8 - 2020-7-12.

Muszynski, Grzegorz, Kashinath, Karthik, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 and Wehner, Michael ORCID: 0000-0001-5991-0082 (2018) Topological Data Analysis and Machine Learning for Recognizing Atmospheric River Patterns in Large Climate Datasets. Geoscientific Model Development. pp. 1-24.

Muszynski, Grzegorz, Kashinath, Karthik, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Wehner, Michael and Prabhat, (2019) Topological data analysis and machine learning for recognizing atmospheric river patterns in large climate datasets. GEOSCIENTIFIC MODEL DEVELOPMENT, 12 (2). pp. 613-628.

Mosca, Marco M ORCID: 0000-0002-1764-2814 and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) Voronoi-Based Similarity Distances between Arbitrary Crystal Lattices. CRYSTAL RESEARCH AND TECHNOLOGY, 55 (5). p. 1900197.

Bright, Matthew, Cooper, Andrew I and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) A complete and continuous map of the Lattice Isometry Space for all 3-dimensional lattices. [Preprint]

Collapse authors list.
Smith, Philip, McLauchlin, Andy, Franklin, Tom, Yan, Peiyao, Cunliffe, Emily, Hasell, Tom, Kurlin, Vitaliy ORCID: 0000-0001-5328-5351, Kerr, Colin, Attwood, Jonathan, Shaver, Michael P et al (show 1 more authors) and McDonald, Tom O ORCID: 0000-0002-9273-9173 (2024) A data-driven analysis of HDPE post-consumer recyclate for sustainable bottle packaging. Resources, Conservation and Recycling, 205. p. 107538.

Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2014) A fast and robust algorithm to count topologically persistent holes in noisy clouds. In: 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014-6-23 - 2014-6-28.

Elkin, Yury, Liu, Di and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space. In: Topology-based methods in Visualisation 2019.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2020) The mergegram of a dendrogram and its stability. In: Mathematical Foundations of Computer Science.

Elkin, Yury (2022) A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud. PhD thesis, University of Liverpool.

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. [Preprint]

Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. [Preprint]