We present an isosurface meshing algorithm, DELISO, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guara...
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
— This paper presents a new Path Planning method based in the inverse of the Logarithm of the Distance Transform and in the Fast Marching Method. The Distance Transform of an ima...
Santiago Garrido, Luis Moreno, Dolores Blanco, Fer...