vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...

We study connected orientable spacelike hypersurfaces $x:M^{n}rightarrowM_q^{n+1}(c)$, isometrically immersed into the Riemannian or Lorentzian space form of curvature $c=-1,0,1$, and index $q=0,1$, satisfying the condition $~L_kx=Ax+b$,~ where $L_k$ is the $textit{linearized operator}$ of the $(k+1)$-th mean curvature $H_{k+1}$ of the hypersurface for a fixed integer $0leq k