Abstract: Let $\mathcal{P}$ be the surface of a convex polyhedron of n vertices. We consider the two-point shortest path query problem for $\mathcal{P}$: Constructing a data structure so that given ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results