scientific article; zbMATH DE number 7051185

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (28)

An efficient sum query algorithm for distance-based locally dominating functions ⋮ Affine invariants of generalized polygons and matching under affine transformations ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Spanners for Directed Transmission Graphs ⋮ Fault-tolerant spanners in networks with symmetric directional antennas ⋮ Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Range queries on uncertain data ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Optimal partition trees ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Approximate range closest-pair queries ⋮ Dynamic geometric data structures via shallow cuttings ⋮ Reachability problems for transmission graphs ⋮ On approximate range counting and depth ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Limits of local search: quality and efficiency ⋮ Range search on tuples of points ⋮ Reachability problems for transmission graphs ⋮ Cache-oblivious range reporting with optimal queries requires superlinear space ⋮ Unnamed Item ⋮ A general approach for cache-oblivious range reporting and approximate range counting ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings ⋮ Near-linear algorithms for geometric hitting sets and set covers ⋮ Unnamed Item ⋮ Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions ⋮ Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces

This page was built for publication: