Publication:4633824
From MaRDI portal
zbMath1422.68230MaRDI QIDQ4633824
Timothy M. Chan, Peyman Afshani
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496791
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Spanners for Directed Transmission Graphs, Simplex Range Searching and Its Variants: A Review, Approximating the k-Level in Three-Dimensional Plane Arrangements, Unnamed Item, Unnamed Item, An efficient sum query algorithm for distance-based locally dominating functions, Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces, Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces, Reachability problems for transmission graphs, On approximate range counting and depth, Reachability problems for transmission graphs, Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions, Dynamic data structures for \(k\)-nearest neighbor queries, Affine invariants of generalized polygons and matching under affine transformations, Optimal partition trees, Limits of local search: quality and efficiency, Cache-oblivious range reporting with optimal queries requires superlinear space, Optimal deterministic algorithms for 2-d and 3-d shallow cuttings, Range queries on uncertain data, A general approach for cache-oblivious range reporting and approximate range counting, Fault-tolerant spanners in networks with symmetric directional antennas, Optimal deterministic shallow cuttings for 3-d dominance ranges, An efficient sum query algorithm for distance-based locally dominating functions, Approximate range closest-pair queries, Dynamic geometric data structures via shallow cuttings, Range search on tuples of points, Near-linear algorithms for geometric hitting sets and set covers, Nearest-neighbor searching under uncertainty. I
