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 ...

New research by Brown University computer scientists may be a key step in bringing volumetric video—video that can be viewed from virtually any perspective in a 3D scene—to computers and smart ...

It’s a weird time to be studying computer science. Recent grads have a higher unemployment rate than those in just about every other major—yes, even philosophy. The internet is littered with rants ...

Abstract: Counting the number of shortest paths between two query vertices on road networks has a wide range of applications and has recently drawn significant research attention. The state-of-the-art ...