11 citations · 54 across the 16 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CG2021★ 5 cited
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
Yury Elkin, Vitaliy Kurlin
Given a reference set of points and a query set of points in a metric space, this paper studies an important problem of finding -nearest neighbors of every point…
cs.CG2021★ 6 cited
Geographic-style maps for 2-dimensional lattices
Matthew Bright, Andrew I Cooper, Vitaliy Kurlin
This paper develops geographic-style maps containing 2D lattices in all known crystals parameterised by recent complete invariants. Motivated by rigid crystal structures, lattices…
cs.CG2021★ 4 cited
Pointwise Distance Distributions for detecting near-duplicates in large materials databases
Daniel Widdowson, Vitaliy Kurlin
Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a mo…