Q. What is the complexity of finding the largest volume bounded cell in an arrangment of  $n$ hyperplanes in dimension $d$?I feel I should know this... But I am not finding a definitive reference.Is it $\Omega(n^d)$?How about the $d{=}2$ specialization:The largest area bounded cell in an arrangement of lines?
Largest cell in an arrangement
computational geometry;high dimensional geometry;arrangements