On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity
© Copyright 2018 by SIAM. Point location problems for n points in d-dimensional Euclidean space (and 'p spaces more generally) have typically had two kinds of running-time solutions: (Nearly-Linear) less than dpoly(d) n logO(d) n time, or (Barely-Subquadratic) f(d)n2-1= (d) time, for various f....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137304 |