Reduction from GeomBase to Visibility From Infinity

From Algorithm Wiki
Jump to navigation Jump to search

FROM: GeomBase TO: Visibility From Infinity

Description

Implications

if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$
then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$

Year

1995

Reference

Anka Gajentaan, Mark H Overmars, On a class of O(n2) problems in computational geometry, Computational Geometry, Volume 5, Issue 3, 1995, Pages 165-185

https://doi.org/10.1016/0925-7721(95)00022-2