@techreport{456c96f38b4b4b279878996533f6225d,
title = "Online Search for a Hyperplane in High-Dimensional Euclidean Space",
abstract = " We consider the online search problem in which a server starting at the origin of a $d$-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which each point on the $d$-dimensional unit sphere can be seen are within a constant factor of each other. We show that this length is in $\Omega(d)\cap O(d^{3/2})$. ",
keywords = "cs.CG, cs.DS",
author = "Antonios Antoniadis and Ruben Hoeksma and S{\'a}ndor Kisfaludi-Bak and Kevin Schewior",
note = "Pages: 7, Figures: 2",
year = "2021",
month = sep,
day = "9",
language = "English",
publisher = "ArXiv.org",
type = "WorkingPaper",
institution = "ArXiv.org",
}