On the Complexity of Closest Pair via Polar-Pair of Point-Sets
From MaRDI portal
Publication:5115796
DOI10.4230/LIPIcs.SoCG.2018.28zbMath1473.05213OpenAlexW2962832554MaRDI QIDQ5115796
Roee David, Bundit Laekhanukit, C. S. Karthik
Publication date: 18 August 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.28
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorial complexity of geometric structures (52C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- On the contact dimensions of graphs
- Space graphs and sphericity
- Dispersed points and geometric embedding of complete bipartite graphs
- Contact patterns of equal nonoverlapping spheres
- A few applications of negative-type inequalities
- Embedding into rectilinear spaces
- Equilateral sets in \(l_p^n\)
- A simple randomized sieve algorithm for the closest-pair problem
- Monotone maps, sphericity and bounded second eigenvalue
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Extensions of Lipschitz mappings into a Hilbert space
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- Hardness of approximate nearest neighbor search
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Automata, Languages and Programming
- Class of constructive asymptotically good algebraic codes
- Computational Complexity
- Equilateral dimension of the rectilinear space
This page was built for publication: On the Complexity of Closest Pair via Polar-Pair of Point-Sets
